Dear Jobst, you wrote (5 Jan 2005): > By the way, is it possible to prove a Beatpath winner > in O(n^2) time also?
Well, with the Dijkstra algorithm you can calculate in O(n^2) time the strengths of the strongest paths from candidate A to every other candidate and from every other candidate to candidate A. Markus Schulze ---- Election-methods mailing list - see http://electorama.com/em for list info
