Author： Gaspers Serge Kratsch Dieter Liedloff Mathieu
Publisher： Springer Publishing Company
ISSN： 0178-4617
Source： Algorithmica, Vol.62, Iss.3-4, 2012-04, pp. : 637-658
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Related content
A note on maximum independent sets in rectangle intersection graphs
By Chan T.M.
Information Processing Letters, Vol. 89, Iss. 1, 2004-01 ,pp. :
Access to resources
Recommend
Finding hidden independent sets in interval graphs
By Biedl T. Brejova B. Demaine E.D. Hamel A.M. Lopez-Ortiz A. Vinar T.V.
Theoretical Computer Science, Vol. 310, Iss. 1, 2004-01 ,pp. :
By Halldorsson M.M. Iwama K. Miyazaki S. Taketomi S.
Theoretical Computer Science, Vol. 289, Iss. 2, 2002-10 ,pp. :
Computing transparently: the independent sets in a graph
By Head Tom
Natural Computing, Vol. 10, Iss. 1, 2011-03 ,pp. :
Independent sets versus perfect matchings
Theoretical Computer Science, Vol. 145, Iss. 1, 1995-07 ,pp. :