Optimal path cover problem on block graphs and bipartite permutation graphs

31Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

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.

Cite

CITATION STYLE

APA

Srikant, R., Sundaram, R., Singh, K. S., & Pandu Rangan, C. (1993). Optimal path cover problem on block graphs and bipartite permutation graphs. Theoretical Computer Science, 115(2), 351–357. https://doi.org/10.1016/0304-3975(93)90123-B

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free