conference paper
Variations on matchings
1989
DGOR - Papers of the 17th Annual Meeting / Vorträge der 17. Jahrestagung 1988
In a graph G = (X, E) we assign each node v a positive integer b (v) ≤ dG(v) where dG(v) is the degree of v in G. Let P be a collection of edge-disjoint chains such that no two chains in P have a common endpoint and such that in the partial graph H formed by the edge set of P we have dG (v) ≤ b(v) for each node v. P is called a chain packing.
Type
conference paper
Author(s)
École Polytechnique Fédérale de Lausanne
Roberts, Fred S.
Rutgers, The State University of New Jersey
Date Issued
1989
Publisher
Publisher place
Berlin, Heidelberg
Published in
DGOR - Papers of the 17th Annual Meeting / Vorträge der 17. Jahrestagung 1988
DOI of the book
ISBN of the book
9783540513322
9783642748622
Series title/Series vol.
Operations Research Proceedings
ISSN (of the series)
0721-5924
2197-9294
Editorial or Peer reviewed
REVIEWED
Written at
EPFL
EPFL units
| Event name | Event acronym | Event place | Event date |
DGOR 1998 | Berlin | 1988-09-13 - 1988-09-16 | |
Available on Infoscience
February 4, 2026
Use this identifier to reference this record