An Algorithm for Determining Whether the Connectivity of a Graph is at Least<i>k</i> (Q4068762): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 06:00, 6 February 2024
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
