A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph (Q3769979)
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 to Find the Shortest Cycle Basis of a Graph |
scientific article; zbMATH DE number 4028920
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph |
scientific article; zbMATH DE number 4028920 |
Statements
A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph (English)
0 references
1987
0 references
cycle basis
0 references
polynomial-time algorithm
0 references
fundamental set of circuits
0 references
0.8898501396179199
0 references
0.8893952369689941
0 references
0.8707103133201599
0 references
0.8623971343040466
0 references
0.8598387837409973
0 references
