Work

Finding a maximum-genus graph imbedding

Year: 1988
Type: article
Abstract: The computational complexity of constructing the imbeddings of a given graph into surfaces of different genus is not well understood. In this paper, topological methods and a reduction to linear matroid parity are used to develop a polynomial-time algorithm to find a maximum-genus cellular imbedding. This seems to be the first imbedding algorithm for which the running time is not exponential in the genus of the imbedding surface.
Language: English
Open Access status: bronze
OpenAlex ID: W2010294998
FWCI: 1.702
Cites: 27
Cited by: 94
Related to: 9