On mapping processes to processors in distributed systems
International Journal of Parallel Programming
Linear algorithm for optimal path cover problem on interval graphs
Information Processing Letters
Optimal covering of cacti by vertex-disjoint paths
Theoretical Computer Science
Optimal path cover problem on block graphs and bipartite permutation graphs
Theoretical Computer Science
The path-partition problem in block graphs
Information Processing Letters
The $L(2,1)$-Labeling Problem on Graphs
SIAM Journal on Discrete Mathematics
Discrete Applied Mathematics
Covering Points of a Digraph with Point-Disjoint Paths and Its Application to Code Optimization
Journal of the ACM (JACM)
Computer Networks
On the k-path partition of graphs
Theoretical Computer Science
Hamiltonian laceability of bubble-sort graphs with edge faults
Information Sciences: an International Journal
Hi-index | 5.23 |
In this paper we investigate the k-path cover problem for graphs, which is to find the minimum number of vertex disjoint k-paths that cover all the vertices of a graph. The k-path cover problem for general graphs is NP-complete. Though notable applications of this problem to database design, network, VLSI design, ring protocols, and code optimization, efficient algorithms are known for only few special classes of graphs. In order to solve this problem for cacti, i.e., graphs where no edge lies on more than one cycle, we introduce the so-called Steiner version of the k-path cover problem, and develop an efficient algorithm for the Steiner k-path cover problem for cacti, which finds an optimal k-path cover for a given cactus in polynomial time.