✦ LIBER ✦

Efficient recognition algorithms for boundary and linear eNCE graph languages

✍ Scribed by Changwook Kim

Book ID: 105749183
Publisher: Springer-Verlag
Year: 2001
Tongue: English
Weight: 117 KB
Volume: 37
Category: Article
ISSN: 0001-5903
DOI: 10.1007/pl00013320

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Efficient algorithms for single- and two

Efficient algorithms for single- and two-layer linear placement of parallel graphs

✍ S.C. Nandy; G.N. Nandakumar; B.B. Bhattacharya 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 904 KB

This paper outlines an algorithm for optimum linear ordering (OLO) of a weighted parallel graph with O(n log k) worst-case time complexity, and O(n + k log(n/k) log k) expected-case time complexity, where n is the total number of nodes and k is the number of chains in the parallel graph. Next, the t

An efficient algorithm for the transitiv

An efficient algorithm for the transitive closure and a linear worst-case complexity result for a class of sparse graphs

✍ Brigitte Jaumard; Michel Minoux 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 516 KB