✦ LIBER ✦

Parallel recognition algorithms for chordal_planar graphs and planar -trees

✍ Scribed by B.S. Panda; Sajal K. Das

Book ID: 108191872
Publisher: Elsevier Science
Year: 2005
Tongue: English
Weight: 193 KB
Volume: 65
Category: Article
ISSN: 0743-7315
DOI: 10.1016/j.jpdc.2005.04.002

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Randomized Parallel Algorithm for Plan

A Randomized Parallel Algorithm for Planar Graph Isomorphism

✍ Hillel Gazit; John H Reif 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 223 KB

We present a parallel randomized algorithm running on a CRCW PRAM, to determine whether two planar graphs are isomorphic, and if so to find the isomorphism. We assume that we have a tree of separators for each planar graph Ž Ž 2 . 1 q ⑀ which can be computed by known algorithms in O log n time with

Parallel algorithms for planar graph iso

Parallel algorithms for planar graph isomorphism and related problems

✍ Jaja, J.; Kosaraju, S.R. 📂 Article 📅 1988 🏛 IEEE ⚖ 833 KB

Parallel algorithms for fractional and m

Parallel algorithms for fractional and maximal independent sets in planar graphs

✍ N. Dadoun; D.G. Kirkpatrick 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 947 KB

Efficient parallel and sequential algori

Efficient parallel and sequential algorithms for 4-coloring perfect planar graphs

✍ Xin He 📂 Article 📅 1990 🏛 Springer 🌐 English ⚖ 816 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

Parallel algorithms for minimal spanning

Parallel algorithms for minimal spanning trees of directed graphs

✍ Yixin Zhang 📂 Article 📅 1989 🏛 Springer 🌐 English ⚖ 570 KB