Preprint
Polynomial size linear programs for problems in P
Abstract
A perfect matching in an undirected graph $G=(V,E)$ is a set of vertex
disjoint edges from $E$ that include all vertices in $V$. The perfect matching
Authors
Avis D; Bremner D; Tiwary HR; Watanabe O
Publication date
August 4, 2014
DOI
10.48550/arxiv.1408.0807
Preprint server
arXiv