On the power of BFS to determine a graph's diameter (Q4446912): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q221664 |
Changed an Item |
||
| Property / author | |||
| Property / author: Derek Gordon Corneil / rank | |||
Normal rank | |||
Revision as of 06:55, 11 February 2024
scientific article; zbMATH DE number 2037562
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the power of BFS to determine a graph's diameter |
scientific article; zbMATH DE number 2037562 |
Statements
On the power of BFS to determine a graph's diameter (English)
0 references
3 February 2004
0 references
graph diameter approximation
0 references
breadth first search
0 references
linear-time algorithm
0 references
\(k\)-chordal graphs
0 references
AT-free graphs
0 references
