A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph (Q3769979): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/0216026 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1966878439 / rank | |||
Normal rank | |||
Latest revision as of 19:16, 19 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
