Profiles
Research Units
Publications
Sign Up
Faculty Login
X
Articles
Open Access
Optimal path cover problem on block graphs and bipartite permutation graphs
Ravi Shanmuga Sundaram
,
Karan Sher Singh
,
Chandrasekharan Pandu Rangan
Published in
1993
DOI:
10.1016/0304-3975(93)90123-B
Volume: 115
Issue: 2
Pages: 351 - 357
Abstract
The optimal path cover problem is to find a minimum number of vertex disjoint paths which together cover all the vertices of the graph. In this paper, we present linear-time algorithms for the optimal path cover problem for the class of block graphs and bipartite permutation graphs. © 1993.
Topics:
Permutation graph
(72)%
72% related to the paper
,
Longest path problem
(71)%
71% related to the paper
,
Path cover
(70)%
70% related to the paper
,
Pathwidth
(68)%
68% related to the paper
and
Cograph
(68)%
68% related to the paper
View more info for "
Optimal path cover problem on block graphs and bipartite permutation graphs
"
Request full-text
Cite
Content may be subject to copyright.
Citations (1)
References (7)
Related Papers (3)
Journal Details
Concepts (8)
Related Papers (3)
Articles
A branch and bound algorithm to minimize completion time variance on a single processor
2003
Articles
Reconstruction of Sequential Cardiac In-Plane Displacement Patterns on the Chest Wall by Laser Speckle Interferometry
1991
Conferences
ARTSENS® mobile: A portable image-free platform for automated evaluation of vascular stiffness
2016 | Institute of Electrical and Electronics Engineers Inc.
About the journal
Journal
Theoretical Computer Science
ISSN
03043975
Open Access
Yes
Concepts (8)
Algorithms
Graph theory
BIPARTITE PERMUTATION GRAPHS
BLOCK GRAPHS
Linear-time algorithms
OPTIMAL PATH COVER PROBLEM
VERTEX DISJOINT PATHS
Optimization
Get all the updates for this publication
Follow