Linear-time algorithm for the matched-domination problem in cographs

ISSN： 0020-7160

Source： International Journal of Computer Mathematics, Vol.88, Iss.10, 2011-07, pp. : 2042-2056

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

Abstract

Related content

A Linear Time Algorithm for the Minimum-weight Feedback Vertex Set Problem in Series-parallel Graphs

By Zhang Shao-qiang Li Guo-jun Li Shu-guang

Acta Mathematicae Applicatae Sinica, Vol. 20, Iss. 4, 2004-11 ,pp. : 579-588

Springer Publishing Company

Access to resources Recommend Favorite

Faster than the Fast Legendre Transform, the Linear-time Legendre Transform

By Lucet Yves

Numerical Algorithms, Vol. 16, Iss. 2, 1997-03 ,pp. : 171-185

Springer Publishing Company

Access to resources Recommend Favorite

On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimension

By Chazelle B. Matousek J.

Journal of Algorithms, Vol. 21, Iss. 3, 1996-11 ,pp. : 579-597

Academic Press

Access to resources Recommend Favorite

Linear‐Time Algorithms for Scattering Number and Hamilton‐Connectivity of Interval Graphs

JOURNAL OF GRAPH THEORY, Vol. 79, Iss. 4, 2015-08 ,pp. : 282-299

John Wiley & Sons Inc

Access to resources Recommend Favorite

An optimal linear time algorithm for quasi-monotonic segmentation

By Lemire Daniel

International Journal of Computer Mathematics, Vol. 86, Iss. 7, 2009-07 ,pp. : 1093-1104

Taylor & Francis Ltd

Access to resources Recommend Favorite