Header menu link for other important links
X
Optimal path cover problem on block graphs and bipartite permutation graphs
Ravi Shanmuga Sundaram, Karan Sher Singh, Chandrasekharan Pandu Rangan
Published in
1993
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.
About the journal
JournalTheoretical Computer Science
ISSN03043975
Open AccessYes
Concepts (8)
  •  related image
    Algorithms
  •  related image
    Graph theory
  •  related image
    BIPARTITE PERMUTATION GRAPHS
  •  related image
    BLOCK GRAPHS
  •  related image
    Linear-time algorithms
  •  related image
    OPTIMAL PATH COVER PROBLEM
  •  related image
    VERTEX DISJOINT PATHS
  •  related image
    Optimization