![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Author: Head Tom
Publisher: Springer Publishing Company
ISSN: 1567-7818
Source: Natural Computing, Vol.10, Iss.1, 2011-03, pp. : 129-138
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
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
On computing graph minor obstruction sets
By Cattell K. Dinneen M.J. Downey R.G. Fellows M.R. Langston M.A.
Theoretical Computer Science, Vol. 233, Iss. 1, 2000-02 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Journal of Symbolic Computation, Vol. 24, Iss. 2, 1997-08 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
By Halldorsson M.M. Iwama K. Miyazaki S. Taketomi S.
Theoretical Computer Science, Vol. 289, Iss. 2, 2002-10 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
On Independent Sets and Bicliques in Graphs
By Gaspers Serge Kratsch Dieter Liedloff Mathieu
Algorithmica, Vol. 62, Iss. 3-4, 2012-04 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Independent sets versus perfect matchings
Theoretical Computer Science, Vol. 145, Iss. 1, 1995-07 ,pp. :