An algorithm for finding a fundamental set of cycles of a graph (Q5568822): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1145/363219.363232 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2095458137 / rank | |||
Normal rank | |||
Latest revision as of 20:54, 19 March 2024
scientific article; zbMATH DE number 3282258
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm for finding a fundamental set of cycles of a graph |
scientific article; zbMATH DE number 3282258 |
Statements
An algorithm for finding a fundamental set of cycles of a graph (English)
0 references
1969
0 references
numerical analysis
0 references
