A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph (Q3769979): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 12:37, 5 March 2024
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
