✦ LIBER ✦

A linear-processor algorithm for depth-first search in planar graphs

✍ Scribed by Gregory E. Shannon

Book ID: 113163178
Publisher: Elsevier Science
Year: 1988
Tongue: English
Weight: 458 KB
Volume: 29
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(88)90048-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A left-first search algorithm for planar

A left-first search algorithm for planar graphs

✍ H. de Fraysseix; P. O. de Mendez; J. Pach 📂 Article 📅 1995 🏛 Springer 🌐 English ⚖ 553 KB

A Nearly Optimal Parallel Algorithm for

A Nearly Optimal Parallel Algorithm for Constructing Depth First Spanning Trees in Planar Graphs

✍ He, Xin; Yesha, Yaacov 📂 Article 📅 1988 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 715 KB

Efficient algorithms for finding depth-f

Efficient algorithms for finding depth-first and breadth-first search trees in permutation graphs

✍ C. Rhee; Y.Daniel Liang; S.K. Dhall; S. Lakshmivarahan 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 512 KB

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

A parallel algorithm for recognizing uno

A parallel algorithm for recognizing unordered depth-first search

✍ Catherine A. Schevon; Jeffrey Scott Vitter 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 678 KB

A linear-time algorithm for edge-disjoin

A linear-time algorithm for edge-disjoint paths in planar graphs

✍ Dorothea Wagner; Karsten Weihe 📂 Article 📅 1995 🏛 Springer-Verlag 🌐 English ⚖ 1007 KB