An efficient search algorithm to find the elementary circuits of a graph (Q5632464)
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: An efficient search algorithm to find the elementary circuits of a graph |
scientific article; zbMATH DE number 3358362
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient search algorithm to find the elementary circuits of a graph |
scientific article; zbMATH DE number 3358362 |
Statements
An efficient search algorithm to find the elementary circuits of a graph (English)
0 references
1970
0 references
