An augmenting path algorithm for linear matroid parity
Combinatorica
Topological graph theory
Journal of the ACM (JACM)
A Linear Time Planarity Algorithm for 2-Complexes
Journal of the ACM (JACM)
Efficient Algorithms for Graphic Intersection and Parity (Extended Abstract)
Proceedings of the 12th Colloquium on Automata, Languages and Programming
On determining the genus of a graph in O(v O(g)) steps(Preliminary Report)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
An efficient algorithm for the genus problem with explicit construction of forbidden subgraphs
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
An Orientation Theorem with Parity Conditions
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
On the graphic matroid parity problem
Journal of Combinatorial Theory Series B
Note: A note on the computational complexity of graph vertex partition
Discrete Applied Mathematics
Minimum cuts and shortest homologous cycles
Proceedings of the twenty-fifth annual symposium on Computational geometry
Information Processing Letters
Algebraic algorithms for linear matroid parity problems
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
On feedback vertex set new measure and new structures
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
An algorithm for weighted fractional matroid matching
Journal of Combinatorial Theory Series B
| Hi-index | 0.00 |
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.