|
gptkbp:instanceOf
|
gptkb:Graph_Theory_Concept
|
|
gptkbp:alsoKnownAs
|
Cut-edge
Ishtmus
|
|
gptkbp:appearsIn
|
gptkb:Undirected_Graph
Connected Graph
Multigraph
|
|
gptkbp:application
|
gptkb:Communication_Networks
Transportation Networks
Network Reliability
|
|
gptkbp:defines
|
An edge in a graph whose removal increases the number of connected components.
|
|
gptkbp:describedYear
|
1932
|
|
gptkbp:example
|
Edge connecting two components
Edge in a tree
|
|
gptkbp:field
|
gptkb:Mathematics
gptkb:Graph_Theory
|
|
gptkbp:firstDescribed
|
gptkb:Hassler_Whitney
|
|
gptkbp:hasWikipediaPage
|
https://en.wikipedia.org/wiki/Bridge_(graph_theory)
|
|
gptkbp:notAppearsIn
|
Complete Graph (with more than two vertices)
|
|
gptkbp:property
|
Critical for graph connectivity
Not part of any cycle
|
|
gptkbp:relatedTo
|
Articulation Point
Block (Graph Theory)
Connected Graph
Edge Connectivity
|
|
gptkbp:supportsAlgorithm
|
gptkb:Depth-First_Search
gptkb:Tarjan's_Algorithm
|
|
gptkbp:bfsParent
|
gptkb:Connected_Undirected_Graph
|
|
gptkbp:bfsLayer
|
7
|
|
https://www.w3.org/2000/01/rdf-schema#label
|
Bridge (Graph Theory)
|