✦ LIBER ✦

A randomized parallel backtracking algorithm

✍ Scribed by Janakiram, V.K.; Agrawal, D.P.; Mehrotra, R.

Book ID: 119773309
Publisher: IEEE
Year: 1988
Tongue: English
Weight: 688 KB
Volume: 37
Category: Article
ISSN: 0018-9340
DOI: 10.1109/12.9745

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Efficiency of Randomized Parallel Backtr

Efficiency of Randomized Parallel Backtrack Search

✍ Yanjun Zhang; A. Ortynski 📂 Article 📅 1999 🏛 Springer 🌐 English ⚖ 128 KB

Parallel backtracking prolog engine

✍ M De Blasi; A Gentile; G Lopez; A Franco 📂 Article 📅 1988 🏛 Elsevier Science ⚖ 261 KB

A simple randomized parallel algorithm f

A simple randomized parallel algorithm for list-ranking

✍ Richard J. Anderson; Gary L. Miller 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 506 KB

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

A fast backtrack algorithm for graph iso

A fast backtrack algorithm for graph isomorphism

✍ Hari Ballabh Mittal 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 492 KB

A simple randomized parallel algorithm f

A simple randomized parallel algorithm for maximal ƒ-matchings

✍ Oscar Garrido; Stefan Jarominek; Andrzej Lingas; Wojciech Rytter 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 449 KB