Algorithms for finding a fundamental set of cycles for an undirected linear graph (Q5541597): 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/363848.363861 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2069151075 / rank | |||
Normal rank | |||
Latest revision as of 03:46, 20 March 2024
scientific article; zbMATH DE number 3255194
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithms for finding a fundamental set of cycles for an undirected linear graph |
scientific article; zbMATH DE number 3255194 |
Statements
Algorithms for finding a fundamental set of cycles for an undirected linear graph (English)
0 references
1967
0 references
numerical analysis
0 references
