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
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph |
scientific article |
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
