Linear Programming and Community Detection

DOI10.1287/moor.2022.1282arXiv2006.03213OpenAlexW4287764681WikidataQ114058147 ScholiaQ114058147MaRDI QIDQ6199276

Aida Khajavirad, Dmitriy Kunisky, Alberto Del Pia

Publication date: 23 February 2024

Published in: Mathematics of Operations Research (Search for Journal in Brave)

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

zbMATH Keywords

linear programmingcommunity detectionmetric polytopeminimum bisection problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Linear programming (90C05) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (1)

Efficient joint object matching via linear programming

This page was built for publication: Linear Programming and Community Detection