Models of machines and computation for mapping in multicomputers
ACM Computing Surveys (CSUR)
Solving the path cover problem on circular-arc graphs by using an approximation algorithm
Discrete Applied Mathematics
On the k-path cover problem for cacti
Theoretical Computer Science
Finding a minimum path cover of a distance-hereditary graph in polynomial time
Discrete Applied Mathematics
Solving the path cover problem on circular-arc graphs by using an approximation algorithm
Discrete Applied Mathematics
Certifying algorithms for the path cover and related problems on interval graphs
ICCSA'10 Proceedings of the 2010 international conference on Computational Science and Its Applications - Volume Part II
| Hi-index | 0.00 |