✦ LIBER ✦

Random parallel algorithms for finding exact branchings, perfect matchings, and cycles

✍ Scribed by D. Bruschi; F. Ravasio

Publisher: Springer
Year: 1995
Tongue: English
Weight: 630 KB
Volume: 13
Category: Article
ISSN: 0178-4617
DOI: 10.1007/bf01293484

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Exact Algorithms for Exact Satisfiabilit

Exact Algorithms for Exact Satisfiability and Number of Perfect Matchings

✍ Andreas Björklund; Thore Husfeldt 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 505 KB

Fast parallel algorithms for finding ham

Fast parallel algorithms for finding hamiltonian paths and cycles in a tournament

✍ Danny Soroker 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 554 KB

Analysis of parallel algorithms for find

Analysis of parallel algorithms for finding a maximal independent set in a random hypergraph

✍ H. Chen; A. M. Frieze 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 726 KB

It is well known [9] that finding a maximal independent set in a graph is in class J%, and [lo] that finding a maximal independent set in a hypergraph with fixed dimension is in %JV"%' . It is not known whether this latter problem remains in A% when the dimension is part of the input. We will study