Corpus ID: 211082851

A simple certifying algorithm for 3-edge-connectivity

@article{Tsin2020ASC,
  title={A simple certifying algorithm for 3-edge-connectivity},
  author={Yung H. Tsin},
  journal={ArXiv},
  year={2020},
  volume={abs/2002.04727}
}
  • Yung H. Tsin
  • Published in ArXiv 2020
  • Computer Science, Mathematics
  • A linear-time certifying algorithm for 3-edge-connectivity is presented. Given an undirected graph G, if G is 3-edge-connected, the algorithm generates a construction sequence as a positive certificate for G. Otherwise, the algorithm decomposes G into its 3-edge-connected components and at the same time generates a construction sequence for each connected component as well as the bridges and a cactus representation of the cut-pairs in G. All of these are done by making only one pass over G… CONTINUE READING

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv