A polyhedral study of the maximum edge subgraph problem
From MaRDI portal
Publication:5891092
DOI10.1016/j.endm.2009.11.033zbMath1268.90112MaRDI 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
90C35: Programming involving graphs or networks
91D30: Social networks; opinion dynamics
90C60: Abstract computational complexity for mathematical programming problems
90B10: Deterministic network models in operations research
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
A polyhedral study of the maximum edge subgraph problem, Combinatorial properties and further facets of maximum edge subgraph polytopes
Cites Work