✦ LIBER ✦

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

✍ Scribed by He, Xin; Yesha, Yaacov

Book ID: 118174153
Publisher: Society for Industrial and Applied Mathematics
Year: 1988
Tongue: English
Weight: 715 KB
Volume: 17
Category: Article
ISSN: 0097-5397
DOI: 10.1137/0217028

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An optimal algorithm for finding depth-f

An optimal algorithm for finding depth-first spanning tree on permutation graphs

✍ Mondal, Sukumar ;Pal, Madhumangal ;Pal, Tapan K. 📂 Article 📅 1999 🏛 Springer-Verlag 🌐 English ⚖ 103 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

An O(log n) parallel algorithm for const

An O(log n) parallel algorithm for constructing a spanning tree on permutation graphs

✍ Wang Yue-Li; Chen Hon-Chan; Lee Chen-Yu 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 396 KB

An efficient parallel algorithm for shif

An efficient parallel algorithm for shifting the root of a depth first spanning tree

✍ Prasoon Tiwari 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 892 KB

A parallel algorithm for generating mult

A parallel algorithm for generating multiple ordering spanning trees in undirected weighted graphs

✍ Ma Jun; Ma Shaohan; Kazuo Iwama; Gu Qianping 📂 Article 📅 1999 🏛 Institute of Applied Mathematics, Chinese Academy 🌐 English ⚖ 441 KB

A linear-processor algorithm for depth-f

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

✍ Gregory E. Shannon 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 458 KB