Jump to content

Talk:Capacitated minimum spanning tree

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by CBM (talk | contribs) at 15:31, 22 November 2009 (maths rating). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
WikiProject iconMathematics Start‑class Low‑priority
WikiProject iconThis article is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.
StartThis article has been rated as Start-class on Wikipedia's content assessment scale.
LowThis article has been rated as Low-priority on the project's priority scale.

needed content

Need reference supporting the claim that EW is one of the best heuristics. Also need a section on Sharma's algorithm.

Lynxoid84 (talk) 23:08, 30 May 2009 (UTC)[reply]