An Algorithm for Determining Whether the Connectivity of a Graph is at Least<i>k</i> (Q4068762): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
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