A general purpose algorithm for counting simple cycles and simple paths of any length (Q2415361): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 20:34, 2 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A general purpose algorithm for counting simple cycles and simple paths of any length |
scientific article |
Statements
A general purpose algorithm for counting simple cycles and simple paths of any length (English)
0 references
21 May 2019
0 references
simple cycles
0 references
simple paths
0 references
self-avoiding walks
0 references
self-avoiding polygons
0 references
elementary circuits
0 references
connected induced subgraphs
0 references
networks
0 references
digraphs
0 references
labeled graphs
0 references
