Characterizations of Reducible Flow Graphs
Journal of the ACM (JACM)
Testing flow graph reducibility
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Proceedings of a symposium on Compiler optimization
Jump Minimization in Linear Time
ACM Transactions on Programming Languages and Systems (TOPLAS) - Lecture notes in computer science Vol. 174
Global array reference allocation
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Optimal code for control structures
POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
NP-Completeness of Some Tree-Clustering Problems
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
On the completeness of a generalized matching problem
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Instruction Set Design and Optimizations for Address Computation in DSP Architectures
ISSS '96 Proceedings of the 9th international symposium on System synthesis
A Noniterative Greedy Algorithm for Multiframe Point Correspondence
IEEE Transactions on Pattern Analysis and Machine Intelligence
Solving the path cover problem on circular-arc graphs by using an approximation algorithm
Discrete Applied Mathematics
On the k-path cover problem for cacti
Theoretical Computer Science
Finding a minimum path cover of a distance-hereditary graph in polynomial time
Discrete Applied Mathematics
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
Solving the path cover problem on circular-arc graphs by using an approximation algorithm
Discrete Applied Mathematics
Minimum node disjoint path covering for circular-arc graphs
Information Processing Letters
The np-completeness of the hamiltonian cycle problem in planar diagraphs with degree bound two
Information Processing Letters
A heuristic algorithm for reconstructing ancestral gene orders with duplications
RECOMB-CG'07 Proceedings of the 2007 international conference on Comparative genomics
Certifying algorithms for the path cover and related problems on interval graphs
ICCSA'10 Proceedings of the 2010 international conference on Computational Science and Its Applications - Volume Part II
Computer Languages
Path covering number and L(2,1)-labeling number of graphs
Discrete Applied Mathematics
| Hi-index | 0.01 |
A point-disjoint path cover of a directed graph is a collection of point-disjoint paths (some paths possibly having zero length) which covers all the points. A path cover which minimizes the number of paths corresponds to an optimal sequence of the steps of a computer program for efficient coding and documentation. The minimization problem for the general directed graph is hard in the sense of being NP-complete. In the case of cycle-free digraphs, however, the problem is polynomial, for it is shown that it can be reduced to the maximum-matching problem. A heuristic given here for finding a near optimal path cover for the general case is based upon applying the maximum-matching algorithm to the subgraphs of an interval decomposition.