Minimum strictly fundamental cycle bases of planar graphs are hard to find (Q266952)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimum strictly fundamental cycle bases of planar graphs are hard to find |
scientific article |
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
