Y. Daniel Liang
ABSTRACT
Whether there exists a polynomial algorithm for the minimal path cover problem in circular-arc graphs remains open. In this paper, we present a polynomial time algorithm for finding a minimal path cover for a set of n arcs in a circular-arc model. Our algorithm takes Ο(nlogn) time.
- 1.A.R. Arikati and C. P. Rmgan, A lineal' algorithm for peth covet problem on interval gret~, Inform. Process. Lat. 35 (1990) 149-153 Google Scholar
Digital Library
- 2.M.A. Bonuccelli and D. P. Borer, Minimum node-disjoint path covering for circular-arc graphs, Inform. Process. Lea. 8 (1979) 159-161.Google Scholar
- 3.M. R. Oarey and D. S. Johnson, Computers and Intractability, A guide to the Theory of NP.Comple.teness, Freeman, San Francisco, 1979. Google ScholarDigital Library
- 4.M. C, Golmnhic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.Google Scholar
- 5.S.E. Goodman, S. T. Hedetniemi and P. J. Slater, Advances on Hamiltcmian comp~ problem, J. ACM 22 (1975) 352-360. Google ScholarDigital Library
- 6.Y. D. Lians, C. Rhee, S. IL Dhall, and S. Lakshmiverahan, an O (nZlogn) algorithm for Hamiltanian path ixoblem in ~-~rc grephs, 29th AIIerton Conf~ 1991.Google Scholar
- 7.Y.D. Lian8, G. IC Msnacher; C. Rhee., T. A. Manku~ S. IC DlmIL and S. Lakslunivarahan, an O (n logn) ai~ for finding a Hamilumian paflm and circuit in circular-arc Oapl=, mammcri~ Augtmt, 1992.Google Scholar
- 8.G. IL Manacher, T. A. Mankus end A. J. Smith, An opthmnn O(nlogn) algorie~m for Rnding a c, manical Hamil~ circuit in a set of intervals, Inform. Process. L~. 35 (1990) 205-211 Google ScholarDigital Library
- 9.S. Moran and Y. Wolfsmhl, Optimal covering of cacti by vertex-disjoint paths, Tech. Rept., Technion Instimm of TecJmology (1988).Google Scholar
- 10.W. Shih, T. C. C1mm, end W. L. H~ An O(n21ogn) algorithm for Hamfltonian cycle problem on circultr-arc graphs. Accepted for publicati~ in SIAM I. Cmnputing. Google ScholarDigital Library
Index Terms
- An O(nlogn) algorithm for finding minimal path cover in circular-arc graphs
Recommendations
Solving the path cover problem on circular-arc graphs by using an approximation algorithm
A path cover of a graph G=(V,E) is a family of vertex-disjoint paths that covers all vertices in V. Given a graph G, the path cover problem is to find a path cover of minimum cardinality. This paper presents a simple O(n)-time approximation algorithm ...
Finding a minimum path cover of a distance-hereditary graph in polynomial time
A path cover of a graph G=(V,E) is a set of pairwise vertex-disjoint paths such that the disjoint union of the vertices of these paths equals the vertex set V of G. The path cover problem is, given a graph, to find a path cover having the minimum number ...
Self-clique Helly circular-arc graphs
A clique in a graph is a complete subgraph maximal under inclusion. The clique graph of a graph is the intersection graph of its cliques. A graph is self-clique when it is isomorphic to its clique graph. A circular-arc graph is the intersection graph of ...
Comments