Talk:Distance (graph theory)

From Wikipedia, the free encyclopedia

Mathematics Portal This article is within the scope of WikiProject Mathematics, which collaborates on articles related to mathematics.
Mathematics rating:	Stub Class	Mid Priority	Field: Discrete mathematics
Please update this rating as the article progresses, or if the rating is inaccurate. Click to show/hide comments. Please add to or update the comments to suggest improvements to the article. Geometry guy 16:48, 10 June 2007 (UTC)

what happens to diameter if the graph is not connected?

[edit] 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. 80.248.242.52 18:14, 26 December 2006 (UTC)

[edit] 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 pseudo-peripheral vertex finding algorithm described in the text? 89.132.107.235 (talk) 20:52, 26 February 2008 (UTC)