An Efficient Algorithm for the Genus Problem with Explicit Construction of Forbidden Subgraphs

act We give an algorithm for imbedding a graph G of n vertices onto an oriented surface of minimal genus g. If g > 0 then we also construct a forbidden subgraph of G which is homeomorphic to a graph of

• Type: Conference
• Year: 1991
• Where: STOC
• Authors: Hristo Djidjev, John H. Reif
• Keywords: Algorithms, Forbidden Subgraph, Minimal Genus G, Oriented Surface, STOC 1991