On a class of strong valid inequalities for the connected matching polytope
Abstract
We identify a family of O(|E(G)|2) nontrivial facets of the connected matching polytope of a graph G, that is, the convex hull of incidence vectors of matchings in G whose covered vertices induce a connected subgraph. Accompanying software to further inspect the polytope of an input graph is available.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.