Finding short cycles in planar graphs using separators (Q3739145)
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 3972889
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding short cycles in planar graphs using separators |
scientific article; zbMATH DE number 3972889 |
Statements
Finding short cycles in planar graphs using separators (English)
0 references
1986
0 references
NP-completeness
0 references
algorithms
0 references
planar graph
0 references
cycles
0 references
0.8845276236534119
0 references
0.8332546353340149
0 references
0.8196972012519836
0 references
0.8139877319335938
0 references
0.7871683239936829
0 references
