A separation algorithm for b-matching degree-sequence polyhedra

  • Authors:

  • Fan Zhang

  • Affiliations:

  • Department of Computing, The Hong Kong Polytechnic University, Kowloon, Hong Kong

  • Venue:
  • Mathematics of Operations Research
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

A b-matching of a graph is an assignment of non-negative integers to edges such that the sum at each node is at most a given bound. Its degree sequence is the vector whose components are the sums at each node. A linear-inequality description for the convex hull of degree sequences of b-matchings of a graph was found by Cunningham and Green-Krótki. This paper presents a polynomial-time combinatorial algorithm that either certifies a given vector as a member of the polyhedron or finds a valid inequality that is violated by the vector.