✦ LIBER ✦

Finding Euler tours in parallel

✍ Scribed by Mikhail Atallah; Uzi Vishkin

Publisher: Elsevier Science
Year: 1984
Tongue: English
Weight: 526 KB
Volume: 29
Category: Article
ISSN: 0022-0000
DOI: 10.1016/0022-0000(84)90003-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Hamilton cycles in Euler tour graph

✍ Fu-Ji Zhang; Xiao-fong Guo 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 390 KB

Hamilton cycles in directed Euler tour g

Hamilton cycles in directed Euler tour graphs

✍ Fu-ji Zhang; Xiao-feng Guo 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 516 KB

Compatible Euler tours for transition sy

Compatible Euler tours for transition systems in Eulerian graphs

✍ Bill Jackson 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 277 KB

We show that ff G is an Eulerian graph of minimum degree 2k, then G has a set S of k -2 Euler tours such that each pair of adjacent edges of G is consecutive in at most one tour of S. We conjecture that our bound of k -2 may be improved to 2k -2.

Finding frequent items in parallel

✍ Massimo Cafaro; Piergiulio Tempesta 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 150 KB

Finding shape numbers in parallel

✍ Kuo-Liang Chung 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 256 KB

Finding congruent regions in parallel

✍ Laurence Boxer 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 308 KB