An Algorithm for Determining Whether the Connectivity of a Graph is at Least<i>k</i> (Q4068762)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An Algorithm for Determining Whether the Connectivity of a Graph is at Least<i>k</i> |
scientific article |
Statements
An Algorithm for Determining Whether the Connectivity of a Graph is at Least<i>k</i> (English)
0 references
1975
0 references