Discounted average degree density metric and new algorithms for the densest subgraph problem
From MaRDI portal
Publication:5228503
DOI10.1002/net.21764zbMath1418.90065OpenAlexW2747333531MaRDI QIDQ5228503
Satoshi Hara, Hiroki Yanagisawa
Publication date: 12 August 2019
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.21764
Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)
Related Items
In search of dense subgraphs: How good is greedy peeling?, The densest subgraph problem with a convex/concave size function