Author： Halldorsson M.M. Iwama K. Miyazaki S. Taketomi S.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.289, Iss.2, 2002-10, pp. : 953-962
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
On Independent Sets and Bicliques in Graphs
By Gaspers Serge Kratsch Dieter Liedloff Mathieu
Algorithmica, Vol. 62, Iss. 3-4, 2012-04 ,pp. :
Access to resources
Recommend
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. :
A note on maximum independent sets in rectangle intersection graphs
By Chan T.M.
Information Processing Letters, Vol. 89, Iss. 1, 2004-01 ,pp. :