✦ LIBER ✦

Solving the path cover problem on circular-arc graphs by using an approximation algorithm

✍ Scribed by Ruo-Wei Hung; Maw-Shang Chang

Book ID: 108112554
Publisher: Elsevier Science
Year: 2006
Tongue: English
Weight: 336 KB
Volume: 154
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2005.07.002

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An optimal parallel algorithm for solvin

An optimal parallel algorithm for solving all-pairs shortest paths problem on circular-arc graphs

✍ Anita Saha; Madhumangal Pal; Tapan K. Pal 📂 Article 📅 2005 🏛 Springer-Verlag 🌐 English ⚖ 232 KB

Solving the all-pair shortest path query

Solving the all-pair shortest path query problem on interval and circular-arc graphs

✍ Chen, Danny Z.; Lee, D. T.; Sridhar, R.; Sekharan, Chandra N. 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 118 KB 👁 3 views

In this paper, we study the following all-pair shortest path query problem: Given the interval model of an unweighted interval graph of n vertices, build a data structure such that each query on the shortest path (or its length) between any pair of vertices of the graph can be processed efficiently

An efficient certifying algorithm for th

An efficient certifying algorithm for the Hamiltonian cycle problem on circular-arc graphs

✍ Ruo-Wei Hung; Maw-Shang Chang 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 673 KB

An Optimal Algorithm to Solve the All-Pa

An Optimal Algorithm to Solve the All-Pairs Shortest Paths Problem on Permutation Graphs

✍ Sukumar Mondal; Madhumangal Pal; Tapan K. Pal 📂 Article 📅 2003 🏛 Springer Netherlands 🌐 English ⚖ 89 KB

An optimal algorithm to solve the all-pa

An optimal algorithm to solve the all-pair shortest path problem on interval graphs

✍ R. Ravi; Madhav V. Marathe; C. Pandu Rangan 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 646 KB