Dominating Induced Matchings for P 7-Free Graphs in Linear Time

Author： Brandstädt Andreas   Mosca Raffaele  

Publisher： Springer Publishing Company

ISSN： 0178-4617

Source： Algorithmica, Vol.68, Iss.4, 2014-04, pp. : 998-1018

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

On clique-colouring of graphs with few P 4’s

By Klein Sulamita   Morgana Aurora  

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

Springer Publishing Company

Access to resources Recommend Favorite

On the (Non-)Existence of Polynomial Kernels for P l -Free Edge Modification Problems

By Guillemot Sylvain   Havet Frédéric   Paul Christophe   Perez Anthony  

Algorithmica, Vol. 65, Iss. 4, 2013-04 ,pp. : 900-926

Springer Publishing Company

Access to resources Recommend Favorite

A linear-time recognition algorithm for P 4 -reducible graphs

By M. Nivat   Jamison B.   Olariu S.  

Theoretical Computer Science, Vol. 145, Iss. 1, 1995-07 ,pp. : 329-344

Elsevier

Access to resources Recommend Favorite

A new smoothing and regularization Newton method for P 0-NCP

By Ma Changfeng  

Journal of Global Optimization, Vol. 48, Iss. 2, 2010-10 ,pp. : 241-261

Springer Publishing Company

Access to resources Recommend Favorite

Small maximal matchings in random graphs

By Zito M.  

Theoretical Computer Science, Vol. 297, Iss. 1, 2003-03 ,pp. : 487-507

Elsevier

Access to resources Recommend Favorite