Talk:Distance (graph theory)
WikiProject Mathematics  (Rated Startclass, Midimportance)  


what happens to diameter if the graph is not connected?
pseudoperipheral vertices in directed graphs ?
Does the given "Algorithm for finding pseudoperipheral 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. 80.248.242.52 18:14, 26 December 2006 (UTC)
asymptotics?
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 pseudoperipheral vertex finding algorithm described in the text? 89.132.107.235 (talk) 20:52, 26 February 2008 (UTC)
Name
Why does the article use the term "geodetic distance"? The usual name is simply "distance". Zaslav (talk) 02:24, 27 October 2015 (UTC)