Max Planck Institute for Informatics, Saarbrücken, Germany
Max Planck Institute for Informatics, Saarbrücken, Germany
978-3-642-45043-3
Graph-Theoretic Concepts in Computer Science
978-3-642-45042-6
We present a linear-time certifying algorithm that tests graphs for 3-edge-connectivity. If the input graph G is not 3-edge-connected, the algorithm returns a 2-edge-cut. If G is 3-edge-connected, the algorithm returns a construction sequence that constructs G from the graph with two nodes and three parallel edges using only operations that (obviously) preserve 3-edge-connectivity.
sequence
true
2022-12-01T06:52
edge
input graph G
algorithm
graph G
2013
nodes
operation
parallel edges
graph
358-369
chapter
2013-01-01
https://scigraph.springernature.com/explorer/license/
Certifying 3-Edge-Connectivity
https://doi.org/10.1007/978-3-642-45043-3_31
chapters
construction sequence
Information and Computing Sciences
Kurt
Mehlhorn
Jansen
Klaus
Brandstädt
Andreas
Schmidt
Jens M.
Computation Theory and Mathematics
doi
10.1007/978-3-642-45043-3_31
Springer Nature - SN SciGraph project
Springer Nature
Rüdiger
Reischuk
dimensions_id
pub.1031615994
Neumann
Adrian