On computing graph minor obstruction sets

Author： Cattell K. Dinneen M.J. Downey R.G. Fellows M.R. Langston M.A.

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.233, Iss.1, 2000-02, pp. : 107-127

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

Computing transparently: the independent sets in a graph

By Head Tom

Natural Computing, Vol. 10, Iss. 1, 2011-03 ,pp. : 129-138

Springer Publishing Company

Access to resources Recommend Favorite

Computing the Newtonian Graph

By Kozen D. Stefansson K.

Journal of Symbolic Computation, Vol. 24, Iss. 2, 1997-08 ,pp. : 125-136

Academic Press

Access to resources Recommend Favorite

Minor-embedding in adiabatic quantum computation: II. Minor-universal graph design

By Choi Vicky

Quantum Information Processing, Vol. 10, Iss. 3, 2011-06 ,pp. : 343-353

Springer Publishing Company

Access to resources Recommend Favorite

Diameter and Treewidth in Minor-Closed Graph Families, Revisited

By Demaine Erik D. Hajiaghayi Mohammad Taghi

Algorithmica, Vol. 40, Iss. 3, 2004-08 ,pp. : 211-215

Springer Publishing Company

Access to resources Recommend Favorite

-languages for sets and LOGSPACE computable graph transformers

By Lisitsa A. Sazonov V.

Theoretical Computer Science, Vol. 175, Iss. 1, 1997-03 ,pp. : 183-222

Elsevier

Access to resources Recommend Favorite