An O(nlogn) algorithm for finding minimal path cover in circular-arc graphs

Authors:
Y. Daniel Liang;G. K. Manacher
Affiliations:
Department of Computer Science, Indiana Purdue University at Fort Wayne, Fort Wayne, IN;Department of Mathematics, Statistics, and Computer Science, University of Illinois at Chicago, Chicago, IL
Venue:
CSC '93 Proceedings of the 1993 ACM conference on Computer science
Year:
1993

Citing 5
Cited 3

Linear algorithm for optimal path cover problem on interval graphs

Information Processing Letters
An optimum &Tgr;(n log n) algorithm for finding a canonical Hamiltonian path and canonical Hamiltonian circuit in a set of intervals

Information Processing Letters
An O(n2 log n) algorithm for the Hamiltonian cycle problem on circular-arc graphs

SIAM Journal on Computing
Advances on the Hamiltonian Completion Problem

Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

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

Discrete Applied Mathematics
Leakage power reduction of embedded memories on FPGAs through location assignment

Proceedings of the 43rd annual Design Automation Conference
Solving the path cover problem on circular-arc graphs by using an approximation algorithm

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

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 &Ogr;(nlogn) time.