A polyhedral study of the maximum edge subgraph problem

DOI10.1016/j.endm.2009.11.033zbMath1268.90112OpenAlexW2180803756MaRDI QIDQ5891092

Javier Marenco, Daniela Saban, Nicolás E. Stier-Moses, Flavia Bonomo-Braberman

Publication date: 19 July 2013

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/20.500.12110/paper_0166218X_v160_n18_p2573_Bonomo

zbMATH Keywords

polyhedral combinatoricsmaximum edge subgraph problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Social networks; opinion dynamics (91D30) Abstract computational complexity for mathematical programming problems (90C60) Deterministic network models in operations research (90B10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

A polyhedral study of the maximum edge subgraph problem ⋮ Combinatorial properties and further facets of maximum edge subgraph polytopes

Cites Work

• Complexity of finding dense subgraphs
• A deterministic approximation algorithm for the densest \(k\)-subgraph problem
• Greedily Finding a Dense Subgraph
• The dense \(k\)-subgraph problem
• Different Formulations for Solving the HeaviestK-Subgraph Problem

This page was built for publication: A polyhedral study of the maximum edge subgraph problem