Optimization over degree sequences of graphs

DOI10.1016/j.dam.2019.12.016zbMath1461.05031arXiv1908.09278OpenAlexW2996795373WikidataQ126426609 ScholiaQ126426609MaRDI QIDQ2663988

Gabriel Deza, Shmuel Onn

Publication date: 20 April 2021

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1908.09278

zbMATH Keywords

hypergraphcombinatorial optimizationmatchingfactordegree sequence

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Hypergraphs (05C65) Deterministic scheduling theory in operations research (90B35) Vertex degrees (05C07)

Related Items (2)

Degree sequence optimization in bounded treewidth ⋮ Uniform and monotone line sum optimization

Uses Software

• GitHub

Cites Work

• Nonlinear discrete optimization. An algorithmic theory
• Some NP-complete problems for hypergraph degree sequences
• General factors of graphs
• Matching is as easy as matrix inversion
• Minconvex Factors of Prescribed Size in Graphs
• Optimization over Degree Sequences
• On the Swap-Distances of Different Realizations of a Graphical Degree Sequence
• Subgraphs with prescribed valencies
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Optimization over degree sequences of graphs