Talk:Distance (graph theory)
|WikiProject Mathematics||(Rated Start-class, Mid-importance)|
what happens to diameter if the graph is not connected?
pseudo-peripheral vertices in directed graphs ?
Does the given "Algorithm for finding pseudo-peripheral vertices" work also in directed graphs? If yes, do I need to use indegree or outdegree? If not, it should be mentioned that the algorithm is only for undirected graphs. 126.96.36.199 18:14, 26 December 2006 (UTC)
How do we know that peripheral vertices are hard to find? What is the asymptotic running time for the best algorithm to find a peripheral vertex? What is the asymptotic running time for the pseudo-peripheral vertex finding algorithm described in the text? 188.8.131.52 (talk) 20:52, 26 February 2008 (UTC)