Degree Realization with Maximum Matching

Amotz Bar-Noy; Igor Kalinichev; David Peleg; Dror Rawitz

doi:10.1007/978-3-032-27732-9_8

Degree Realization with Maximum Matching

Amotz Bar-Noy
, Igor Kalinichev
, David Peleg
, Dror Rawitz

Bar-Ilan University - The Alexander Kofkin Faculty of Engineering

City University of New York
Weizmann Institute of Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

The Maximum MatchingDegree Realization problem requires, for a sequence d of n positive integers, to compute a realizing graph (whose degree sequence corresponds to d) with the maximum possible matching. We present a polynomial-time algorithm for this problem.

Original language	English
Title of host publication	Combinatorial Algorithms - 37th International Workshop, IWOCA 2026, Proceedings
Editors	Florent Foucaud, Aline Parreau
Publisher	Springer Science and Business Media Deutschland GmbH
Pages	103-117
Number of pages	15
ISBN (Print)	9783032277312
DOIs	https://doi.org/10.1007/978-3-032-27732-9_8
State	Published - 2026
Event	37th International Workshop on Combinatorial Algorithms, IWOCA 2026 - Clermont-Ferrand, France Duration: 8 Jun 2026 → 11 Jun 2026

Publication series

Name	Lecture Notes in Computer Science
Volume	16587 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	37th International Workshop on Combinatorial Algorithms, IWOCA 2026
Country/Territory	France
City	Clermont-Ferrand
Period	8/06/26 → 11/06/26

Bibliographical note

Publisher Copyright:
© The Author(s), under exclusive license to Springer Nature Switzerland AG 2026.

Keywords

Degree realization
Degree sequences
Graph algorithms
Maximum matching

Access to Document

10.1007/978-3-032-27732-9_8

Cite this

Bar-Noy, A., Kalinichev, I., Peleg, D., & Rawitz, D. (2026). Degree Realization with Maximum Matching. In F. Foucaud, & A. Parreau (Eds.), Combinatorial Algorithms - 37th International Workshop, IWOCA 2026, Proceedings (pp. 103-117). (Lecture Notes in Computer Science; Vol. 16587 LNCS). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-032-27732-9_8

@inproceedings{d5b07af2660d421faf77105a9be25541,

title = "Degree Realization with Maximum Matching",

abstract = "The Maximum MatchingDegree Realization problem requires, for a sequence d of n positive integers, to compute a realizing graph (whose degree sequence corresponds to d) with the maximum possible matching. We present a polynomial-time algorithm for this problem.",

keywords = "Degree realization, Degree sequences, Graph algorithms, Maximum matching",

author = "Amotz Bar-Noy and Igor Kalinichev and David Peleg and Dror Rawitz",

note = "Publisher Copyright: {\textcopyright} The Author(s), under exclusive license to Springer Nature Switzerland AG 2026.; 37th International Workshop on Combinatorial Algorithms, IWOCA 2026 ; Conference date: 08-06-2026 Through 11-06-2026",

year = "2026",

doi = "10.1007/978-3-032-27732-9\_8",

language = "אנגלית",

isbn = "9783032277312",

series = "Lecture Notes in Computer Science",

publisher = "Springer Science and Business Media Deutschland GmbH",

pages = "103--117",

editor = "Florent Foucaud and Aline Parreau",

booktitle = "Combinatorial Algorithms - 37th International Workshop, IWOCA 2026, Proceedings",

address = "גרמניה",

}

Bar-Noy, A, Kalinichev, I, Peleg, D & Rawitz, D 2026, Degree Realization with Maximum Matching. in F Foucaud & A Parreau (eds), Combinatorial Algorithms - 37th International Workshop, IWOCA 2026, Proceedings. Lecture Notes in Computer Science, vol. 16587 LNCS, Springer Science and Business Media Deutschland GmbH, pp. 103-117, 37th International Workshop on Combinatorial Algorithms, IWOCA 2026, Clermont-Ferrand, France, 8/06/26. https://doi.org/10.1007/978-3-032-27732-9_8

Degree Realization with Maximum Matching. / Bar-Noy, Amotz; Kalinichev, Igor; Peleg, David et al.
Combinatorial Algorithms - 37th International Workshop, IWOCA 2026, Proceedings. ed. / Florent Foucaud; Aline Parreau. Springer Science and Business Media Deutschland GmbH, 2026. p. 103-117 (Lecture Notes in Computer Science; Vol. 16587 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Degree Realization with Maximum Matching

AU - Bar-Noy, Amotz

AU - Kalinichev, Igor

AU - Peleg, David

AU - Rawitz, Dror

N1 - Publisher Copyright: © The Author(s), under exclusive license to Springer Nature Switzerland AG 2026.

PY - 2026

Y1 - 2026

N2 - The Maximum MatchingDegree Realization problem requires, for a sequence d of n positive integers, to compute a realizing graph (whose degree sequence corresponds to d) with the maximum possible matching. We present a polynomial-time algorithm for this problem.

AB - The Maximum MatchingDegree Realization problem requires, for a sequence d of n positive integers, to compute a realizing graph (whose degree sequence corresponds to d) with the maximum possible matching. We present a polynomial-time algorithm for this problem.

KW - Degree realization

KW - Degree sequences

KW - Graph algorithms

KW - Maximum matching

UR - https://www.scopus.com/pages/publications/105041640988

U2 - 10.1007/978-3-032-27732-9_8

DO - 10.1007/978-3-032-27732-9_8

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:105041640988

SN - 9783032277312

T3 - Lecture Notes in Computer Science

SP - 103

EP - 117

BT - Combinatorial Algorithms - 37th International Workshop, IWOCA 2026, Proceedings

A2 - Foucaud, Florent

A2 - Parreau, Aline

PB - Springer Science and Business Media Deutschland GmbH

T2 - 37th International Workshop on Combinatorial Algorithms, IWOCA 2026

Y2 - 8 June 2026 through 11 June 2026

ER -