原书出处
Introduction to Algorithms, Fourth Edition
21 第21章 最小生成树
n algorithm based on precomputed “MST decision trees” that also runs in O(E (E, V)) time.
A related problem is spanning-tree verification: given a graph G = (V, E) and a tree T ⊆ E, determine whether T is a minimum spanning tree of G. King [254] gives a linear-time algorithm to verify a spanning tree,
building on earlier work of Komlós [269] and Dixon, Rauch, and Tarjan [120]. The above al
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter021.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea