Compact systems for T-join and perfect matching polyhedra of graphs with bounded genus

Authors:
A. M. H. Gerards
Affiliations:
CWI, Mathematical Centre, P.O. Box 4079, 1009 AB Amsterdam, Netherlands
Venue:
Operations Research Letters
Year:
1991

Citing 4
Cited 0

A new polynomial-time algorithm for linear programming

Combinatorica
Expressing combinatorial optimization problems by linear programs

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
The graph genus problem is NP-complete

Journal of Algorithms
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

We extend a result of Barahona, saying that T-join and perfect matching problems for planar graphs can be formulated as linear programming problems using only a polynomial number of constraints and variables, to graphs embeddable on an arbitrary, but fixed, surface.