An Algorithm for Determining Whether the Connectivity of a Graph is at Least<i>k</i> (Q4068762): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2121765622 / rank | |||
Normal rank | |||
Latest revision as of 02:01, 20 March 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
