Research any topic before you write.
Find related topics. | Discover entities. | See connections. | Build a topical map.
Bridge (graph theory): Bridgeless graphs, Tarjan's bridge-finding algorithm & Bridge-finding with chain decompositions
In graph theory, a bridge, isthmus, cut-edge, or cut arc is an edge of a graph whose deletion increases the graph's number of connected components. Equivalently, an edge is a bridge if and only if it is not contained in any cycle. For a connected graph, a bridge can uniquely determine a cut. A graph is said to be bridgeless or isthmus-free if it contains…
Language: English [EN]
