✦ LIBER ✦

A parallel algorithm for eliminating cycles in undirected graphs

✍ Scribed by Philip Klein; Clifford Stein

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Efficient approximation algorithms for s

✍ Andrzej Lingas; Eva-Marta Lundell 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 162 KB

A parallel algorithm for generating mult

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

Parallel algorithms for finding Hamilton

✍ A.M. Frieze 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 353 KB

A parallel algorithm for edge-coloring o

✍ Eliezer A. Albacea 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 475 KB

Parallel algorithms for finding a subopt

✍ Zbigniew J. Czech; Marek Konopka; Bohdan S. Majewski 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 639 KB

An Efficient Parallel Algorithm for Find

✍ M. Furer; B. Raghavachari 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 763 KB