A polynomial time algorithm for cyclic vertex connectivity of cubic graphs (Q4976338)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A polynomial time algorithm for cyclic vertex connectivity of cubic graphs |
scientific article; zbMATH DE number 6754541
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A polynomial time algorithm for cyclic vertex connectivity of cubic graphs |
scientific article; zbMATH DE number 6754541 |
Statements
A polynomial time algorithm for cyclic vertex connectivity of cubic graphs (English)
0 references
28 July 2017
0 references
cyclic vertex connectivity
0 references
maximum flow
0 references
computational complexity
0 references
cubic graph
0 references
0.9344500303268432
0 references
0.9208658933639526
0 references
0.8800278306007385
0 references
0.8696596622467041
0 references
0.869258463382721
0 references
