Path partition for graphs with special blocks
Discrete Applied Mathematics
Solving the path cover problem on circular-arc graphs by using an approximation algorithm
Discrete Applied Mathematics
The 2-Terminal-Set Path Cover Problem and Its Polynomial Solution on Cographs
FAW '08 Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics
Solving the path cover problem on circular-arc graphs by using an approximation algorithm
Discrete Applied Mathematics
A polynomial solution to the k-fixed-endpoint path cover problem on proper interval graphs
Theoretical Computer Science
The longest path problem is polynomial on cocomparability graphs
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
Efficient algorithms for the longest path problem
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Computing and counting longest paths on circular-arc graphs in polynomial time
Discrete Applied Mathematics
Hi-index | 0.05 |