A note on finding the bridges of a graph (Q1844076): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Depth-First Search and Linear Graph Algorithms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Dividing a Graph into Triconnected Components / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5585020 / rank | |||
Normal rank | |||
Latest revision as of 13:38, 12 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on finding the bridges of a graph |
scientific article |
Statements
A note on finding the bridges of a graph (English)
0 references
1974
0 references
algorithm
0 references
bridge
0 references
connectivity
0 references
search
0 references
spanning tree
0 references
