1990 | OriginalPaper | Buchkapitel
The Complexity of the Graph Embedding Problem
verfasst von : D. Archdeacon
Erschienen in: Topics in Combinatorics and Graph Theory
Verlag: Physica-Verlag HD
Enthalten in: Professional Book Archive
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
We investigate the computational complexity of determining if a graph G on v vertices embeds in a surface S. Robertson and Seymour have given an O(v3) decision algorithm for this embedding problem. We show here how the use the yes/no output from their algorithm to construct the embedding, that is, we self-reduce the search algorithm to the decision algorithm. We conclude that for each fixed surface S there exists an O(v10) algorithm for constructing an embedding or answering that no embedding exists.