Approximation Algorithms for Independent Sets in Map Graphs

ISSN： 0196-6774

Source： Journal of Algorithms, Vol.41, Iss.1, 2001-10, pp. : 20-40

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

On independent sets in random graphs

RANDOM STRUCTURES AND ALGORITHMS, Vol. 47, Iss. 3, 2015-10 ,pp. : 436-486

John Wiley & Sons Inc

Access to resources Recommend Favorite

Independent sets in the graphs with bounded minors of the extended incidence matrix

By Alekseev V. Zakharova D.

Journal of Applied and Industrial Mathematics, Vol. 5, Iss. 1, 2011-01 ,pp. : 14-18

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

A New Method for Enumerating Independent Sets of a Fixed Size in General Graphs

JOURNAL OF GRAPH THEORY, Vol. 81, Iss. 1, 2016-01 ,pp. : 57-72

John Wiley & Sons Inc

Access to resources Recommend Favorite

Invariant Gaussian processes and independent sets on regular graphs of large girth

RANDOM STRUCTURES AND ALGORITHMS, Vol. 47, Iss. 2, 2015-09 ,pp. : 284-303

John Wiley & Sons Inc

Access to resources Recommend Favorite

Approximation of pathwidth of outerplanar graphs

By Bodlaender H.L. Fomin F.V.

Journal of Algorithms, Vol. 43, Iss. 2, 2002-05 ,pp. : 190-200

Academic Press

Access to resources Recommend Favorite