Sciweavers

64
Voted
STOC
1991
ACM

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

15 years 11 days ago
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
Hristo Djidjev, John H. Reif
Added 27 Aug 2010
Updated 27 Aug 2010
Type Conference
Year 1991
Where STOC
Authors Hristo Djidjev, John H. Reif
Comments (0)