Algorithms for finding a fundamental set of cycles for an undirected linear graph (Q5541597)
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: Algorithms for finding a fundamental set of cycles for an undirected linear graph |
scientific article; zbMATH DE number 3255194
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
