Supermodularity in unweighted graph optimization II: Matroidal term rank augmentation

Kristóf Bérczi, A. Frank

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

Ryser's max term rank formula with graph theoretic terminology is equivalent to a characterization of degree sequences of simple bipartite graphs with a specific matching number. In a previous paper by the authors, a generalization was developed for the case when the degrees are constrained by upper and lower bounds. Here, two other extensions of Ryser's theorem are discussed. The first one is a matroidal model, while the second one settles the augmentation version. In fact, the two directions shall be integrated into one single framework.

Original languageEnglish
Pages (from-to)754-762
Number of pages9
JournalMathematics of Operations Research
Volume43
Issue number3
DOIs
Publication statusPublished - Aug 1 2018

Fingerprint

Supermodularity
Matching number
Degree Sequence
Augmentation
Terminology
Simple Graph
Bipartite Graph
Upper and Lower Bounds
Optimization
Term
Graph in graph theory
Theorem
Model
Generalization
Framework
Integrated
Bipartite graph
Graph
Lower bounds
Upper bound

Keywords

  • Augmentation
  • Bipartite matching
  • Matroids
  • Term rank

ASJC Scopus subject areas

  • Mathematics(all)
  • Computer Science Applications
  • Management Science and Operations Research

Cite this

Supermodularity in unweighted graph optimization II : Matroidal term rank augmentation. / Bérczi, Kristóf; Frank, A.

In: Mathematics of Operations Research, Vol. 43, No. 3, 01.08.2018, p. 754-762.

Research output: Contribution to journalArticle

@article{461c0091ea58450aac2b6ea4c817a7a3,
title = "Supermodularity in unweighted graph optimization II: Matroidal term rank augmentation",
abstract = "Ryser's max term rank formula with graph theoretic terminology is equivalent to a characterization of degree sequences of simple bipartite graphs with a specific matching number. In a previous paper by the authors, a generalization was developed for the case when the degrees are constrained by upper and lower bounds. Here, two other extensions of Ryser's theorem are discussed. The first one is a matroidal model, while the second one settles the augmentation version. In fact, the two directions shall be integrated into one single framework.",
keywords = "Augmentation, Bipartite matching, Matroids, Term rank",
author = "Krist{\'o}f B{\'e}rczi and A. Frank",
year = "2018",
month = "8",
day = "1",
doi = "10.1287/moor.2017.0902",
language = "English",
volume = "43",
pages = "754--762",
journal = "Mathematics of Operations Research",
issn = "0364-765X",
publisher = "INFORMS Inst.for Operations Res.and the Management Sciences",
number = "3",

}

TY - JOUR

T1 - Supermodularity in unweighted graph optimization II

T2 - Matroidal term rank augmentation

AU - Bérczi, Kristóf

AU - Frank, A.

PY - 2018/8/1

Y1 - 2018/8/1

N2 - Ryser's max term rank formula with graph theoretic terminology is equivalent to a characterization of degree sequences of simple bipartite graphs with a specific matching number. In a previous paper by the authors, a generalization was developed for the case when the degrees are constrained by upper and lower bounds. Here, two other extensions of Ryser's theorem are discussed. The first one is a matroidal model, while the second one settles the augmentation version. In fact, the two directions shall be integrated into one single framework.

AB - Ryser's max term rank formula with graph theoretic terminology is equivalent to a characterization of degree sequences of simple bipartite graphs with a specific matching number. In a previous paper by the authors, a generalization was developed for the case when the degrees are constrained by upper and lower bounds. Here, two other extensions of Ryser's theorem are discussed. The first one is a matroidal model, while the second one settles the augmentation version. In fact, the two directions shall be integrated into one single framework.

KW - Augmentation

KW - Bipartite matching

KW - Matroids

KW - Term rank

UR - http://www.scopus.com/inward/record.url?scp=85051552160&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85051552160&partnerID=8YFLogxK

U2 - 10.1287/moor.2017.0902

DO - 10.1287/moor.2017.0902

M3 - Article

AN - SCOPUS:85051552160

VL - 43

SP - 754

EP - 762

JO - Mathematics of Operations Research

JF - Mathematics of Operations Research

SN - 0364-765X

IS - 3

ER -