A time-optimal solution for the path cover problem on cographs

By Nakano K.   Olariu S.   Zomaya A.Y.  

Theoretical Computer Science, Vol. 290, Iss. 3, 2003-01 ,pp. : 1541-1556

Elsevier

Access to resources Recommend Favorite

The 1-Fixed-Endpoint Path Cover Problem is Polynomial on Interval Graphs

By Asdre Katerina   Nikolopoulos Stavros  

Algorithmica, Vol. 58, Iss. 3, 2010-11 ,pp. : 679-710

Springer Publishing Company

Access to resources Recommend Favorite

Optimal parallel algorithms for path problems on planar graphs

By Srikrishna G.   Rangan C.P.  

Theoretical Computer Science, Vol. 145, Iss. 1, 1995-07 ,pp. : 27-43

Elsevier

Access to resources Recommend Favorite

On the k-path partition of graphs

By Steiner G.  

Theoretical Computer Science, Vol. 290, Iss. 3, 2003-01 ,pp. : 2147-2155

Elsevier

Access to resources Recommend Favorite

On the classification problem for split graphs

By Morais de Almeida Sheila  

Journal of the Brazilian Computer Society, Vol. 18, Iss. 2, 2012-06 ,pp. : 95-101

Springer Publishing Company

Access to resources Recommend Favorite