Combinatorial properties and further facets of maximum edge subgraph polytopes

DOI10.1016/j.endm.2011.05.052zbMath1268.05207OpenAlexW2029898467MaRDI QIDQ2840727

Daniela Saban, Javier Marenco

Publication date: 23 July 2013

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

Full work available at URL: https://doi.org/10.1016/j.endm.2011.05.052

zbMATH Keywords

facetsdiameter of polytopesmaximum edge subgraph problem

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

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

This page was built for publication: Combinatorial properties and further facets of maximum edge subgraph polytopes