✦ LIBER ✦

Recognition algorithm for intersection graphs of edge disjoint paths in a tree

✍ Scribed by B.S. Panda; S.P. Mohanty

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 513 KB
Volume: 49
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(94)90091-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Triangulated edge intersection graphs of

Triangulated edge intersection graphs of paths in a tree

✍ Maciej M. Sysło 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 268 KB

Edge and vertex intersection of paths in

Edge and vertex intersection of paths in a tree

✍ Martin Charles Golumbic; Robert E. Jamison 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 572 KB

Approximation algorithms for covering a

Approximation algorithms for covering a graph by vertex-disjoint paths of maximum total weight

✍ Shlomo Moran; Ilan Newman; Yaron Wolfstahl 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 464 KB

On the equivalence in complexity among t

On the equivalence in complexity among three computation problems on maximum number of edge-disjoint s−t paths in a probabilistic graph

✍ Pen Cheng; Shigeru Masuyama 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 396 KB

Efficient Parallel Algorithms for Optima

Efficient Parallel Algorithms for Optimally Locating a Path and a Tree of a Specified Length in a Weighted Tree Network

✍ Biing-Feng Wang 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 128 KB

In this paper, we propose efficient parallel algorithms on the EREW PRAM for optimally locating in a tree network a path-shaped facility and a tree-shaped facility of a specified length. Edges in the tree network have arbitrary positive lengths. Two optimization criteria are considered: minimum ecce