Information Processing Letters
An Approximate Algorithm for the Weighted Hamiltonian Path Completion Problem on a Tree
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
On the k-path partition of graphs
Theoretical Computer Science
A linear algorithm for the Hamiltonian completion number of the line graph of a cactus
Discrete Applied Mathematics - The 1st cologne-twente workshop on graphs and combinatorial optimization (CTW 2001)
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
On the k-path cover problem for cacti
Theoretical Computer Science
The approximability of the weighted Hamiltonian path completion problem on a tree
Theoretical Computer Science
Finding a minimum path cover of a distance-hereditary graph in polynomial time
Discrete Applied Mathematics
Necessary Condition for Path Partitioning Constraints
CPAIOR '07 Proceedings of the 4th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Solving the path cover problem on circular-arc graphs by using an approximation algorithm
Discrete Applied Mathematics
Path covering number and L(2,1)-labeling number of graphs
Discrete Applied Mathematics
Hi-index | 0.89 |