A shortest cycle for each vertex of a graph (Q1944201): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.ipl.2011.07.019 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.IPL.2011.07.019 / rank | |||
Normal rank | |||
Latest revision as of 14:44, 16 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A shortest cycle for each vertex of a graph |
scientific article |
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
