On the power of BFS to determine a graph's diameter.

Derek G. Corneil Feodor F. Dragan Ekkehard Köhler

Published in: Networks (2003)

Keyphrases

breadth first search
depth first search
graph representation
graph structure
bipartite graph
power consumption
graph theory
random walk
connected components
weighted graph
graph model
graph partitioning
structured data
graph theoretic
graph clustering
graph matching
neural network
graph construction
mobile robot