Minimum strictly fundamental cycle bases of planar graphs are hard to find (Q266952)
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: Minimum strictly fundamental cycle bases of planar graphs are hard to find |
scientific article; zbMATH DE number 6566339
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimum strictly fundamental cycle bases of planar graphs are hard to find |
scientific article; zbMATH DE number 6566339 |
Statements
Minimum strictly fundamental cycle bases of planar graphs are hard to find (English)
0 references
7 April 2016
0 references
minimum strictly fundamental cycle basis
0 references
NP-completeness
0 references
planar graph
0 references
0 references
0.8172343373298645
0 references
0.8022598028182983
0 references
0.7955840826034546
0 references
0.7904423475265503
0 references
