๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A linear-time algorithm for finding a minimum spanning pseudoforest

โœ Scribed by Harold N. Gabow; Robert E. Tarjan

Book ID
113163219
Publisher
Elsevier Science
Year
1988
Tongue
English
Weight
460 KB
Volume
27
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A linear time algorithm for finding dept
A linear time algorithm for finding depth-first spanning trees on trapezoid graphs
โœ Hon-Chan Chen; Yue-Li Wang ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 458 KB

Let G be a connected graph of n vertices and m edges. The problem of finding a depth-first spanning tree of G is to find a subgraph of G connecting the n vertices with n -1 edges by depth-first search. In this paper, we propose an O(n) time algorithm for solving this problem on trapezoid graphs. Our