Bridge (graph theory)
In graph theory, a bridge (also known as a cut-edge or cut arc or an isthmus) is an edge whose deletion increases the number of connected components. Equivalently, an edge is a bridge if and only if it is not contained in any cycle. A graph is said to be bridgeless if it contains no bridges.
Trees and forests
A graph with nodes can contain at most bridges, since adding additional edges must create a cycle. The graphs with exactly bridges are exactly the trees, and the graphs in which every edge is a bridge are exactly the forests.
In every undirected graph, there is an equivalence relation on the vertices according to which two vertices are related to each other whenever there are two edge-disjoint paths connecting them. (Every vertex is related to itself via two length-zero paths, which are identical but nevertheless edge-disjoint.) The equivalence classes of this relation are called 2-edge-connected components, and the bridges of the graph are exactly the edges whose endpoints belong to different components. The bridge-block tree of the graph has a vertex for every nontrivial component and an edge for every bridge.
Relation to vertex connectivity
Bridges are closely related to the concept of articulation vertices, vertices that belong to every path between some pair of other vertices. The two endpoints of a bridge are articulation vertices unless they have a degree of 1, although it may also be possible for a non-bridge edge to have two articulation vertices as endpoints. Analogously to bridgeless graphs being 2-edge-connected, graphs without articulation vertices are 2-vertex-connected.
In a cubic graph, every cut vertex is an endpoint of at least one bridge.
A bridgeless graph is a graph that does not have any bridges. Equivalent conditions are that each connected component of the graph has an open ear decomposition, that each connected component is 2-edge-connected, or (by Robbins' theorem) that every connected component has a strong orientation.
An important open problem involving bridges is the cycle double cover conjecture, due to Seymour and Szekeres (1978 and 1979, independently), which states that every bridgeless graph admits a set of simple cycles which contains each edge exactly twice.
Tarjan's Bridge-finding algorithm
- Find a spanning forest of
- Create a rooted forest from the spanning tree
- Traverse the forest in preorder and number the nodes. Parent nodes in the forest now have lower numbers than child nodes.
- For each node in preorder, do:
- Compute the number of forest descendants for this node, by adding one to the sum of its children's descendants.
- Compute , the lowest preorder label reachable from by a path for which all but the last edge stays within the subtree rooted at . This is the minimum of the set consisting of the values of at child nodes of and of the preorder labels of nodes reachable from by edges that do not belong to .
- Similarly, compute , the highest preorder label reachable by a path for which all but the last edge stays within the subtree rooted at . This is the maximum of the set consisting of the values of at child nodes of and of the preorder labels of nodes reachable from by edges that do not belong to .
- For each node with parent node , if and then the edge from to is a bridge.
Bridge-Finding with Chain Decompositions
A very simple bridge-finding algorithm uses chain decompositions. Chain decompositions do not only allow to compute all bridges of a graph, they also allow to read off every cut vertex of G (and the block-cut tree of G), giving a general framework for testing 2-edge- and 2-vertex-connectivity (which extends to linear-time 3-edge- and 3-vertex-connectivity tests).
Chain decompositions are special ear decompositions depending on a DFS-tree T of G and can be computed very simply: Let every vertex be marked as unvisited. For each vertex v in ascending DFS-numbers 1...n, traverse every backedge (i.e. every edge not in the DFS tree) that is incident to v and follow the path of tree-edges back to the root of T, stopping at the first vertex that is marked as visited. During such a traversal, every traversed vertex is marked as visited. Thus, a traversal stops at the latest at v and forms either a directed path or cycle, beginning with v; we call this path or cycle a chain. The ith chain found by this procedure is referred to as Ci. C=C1,C2,... is then a chain decomposition of G.
The following characterizations then allow to read off several properties of G from C efficiently, including all bridges of G. Let C be a chain decomposition of a simple connected graph G=(V,E).
- G is 2-edge-connected if and only if the chains in C partition E.
- An edge e in G is a bridge if and only if e is not contained in any chain in C.
- If G is 2-edge-connected, C is an ear decomposition.
- G is 2-vertex-connected if and only if G has minimum degree 2 and C1 is the only cycle in C.
- A vertex v in a 2-edge-connected graph G is a cut vertex if and only if v is the first vertex of a cycle in C - C1.
- If G is 2-vertex-connected, C is an open ear decomposition.
- Bollobás, Béla (1998), Modern Graph Theory, Graduate Texts in Mathematics 184, New York: Springer-Verlag, p. 6, doi:10.1007/978-1-4612-0619-4, ISBN 0-387-98488-7, MR 1633290.
- Westbrook, Jeffery; Tarjan, Robert E. (1992), "Maintaining bridge-connected and biconnected components on-line", Algorithmica 7 (5-6): 433–464, doi:10.1007/BF01758773, MR 1154584.
- Robbins, H. E. (1939), "A theorem on graphs, with an application to a problem of traffic control", The American Mathematical Monthly 46: 281–283.
- Jaeger, F. (1985), "A survey of the cycle double cover conjecture", Annals of Discrete Mathematics 27 – Cycles in Graphs, North-Holland Mathematics Studies 27, pp. 1–12, doi:10.1016/S0304-0208(08)72993-1.
- Tarjan, R. Endre, "A note on finding the bridges of a graph", Information Processing Letters 2 (6): 160–161, doi:10.1016/0020-0190(74)90003-9, MR 0349483.
- Schmidt, Jens M. (2013), "A Simple Test on 2-Vertex- and 2-Edge-Connectivity", Information Processing Letters 113 (7): 241–244, doi:10.1016/j.ipl.2013.01.016.