A shortest cycle for each vertex of a graph (Q1944201)
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: A shortest cycle for each vertex of a graph |
scientific article; zbMATH DE number 6150490
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A shortest cycle for each vertex of a graph |
scientific article; zbMATH DE number 6150490 |
Statements
A shortest cycle for each vertex of a graph (English)
0 references
4 April 2013
0 references
graph algorithms
0 references
girth
0 references
shortest path
0 references
undirected graph
0 references
0.8741869330406189
0 references
0.871159017086029
0 references
0.82830810546875
0 references
0.8275076746940613
0 references
