A polynomial algorithm determining cyclic vertex connectivity of 4-regular graphs (Q2424828)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7073199
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A polynomial algorithm determining cyclic vertex connectivity of 4-regular graphs |
scientific article; zbMATH DE number 7073199 |
Statements
A polynomial algorithm determining cyclic vertex connectivity of 4-regular graphs (English)
0 references
25 June 2019
0 references
cyclic vertex connectivity
0 references
4-regular graph
0 references
maximum flow
0 references
time complexity
0 references
0 references
0.9471588730812072
0 references
0.9208658933639526
0 references
0.8729186654090881
0 references
0.8573251366615295
0 references
0.8296576738357544
0 references
