In search of dense subgraphs: How good is greedy peeling?

DOI10.1002/net.22034arXiv1911.02356OpenAlexW3137361208MaRDI QIDQ6087137

Michele Monaci, Naga Venkata C. Gudapati, Enrico Malaguti

Publication date: 11 December 2023

Published in: Networks (Search for Journal in Brave)

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

zbMATH Keywords

approximationcomputational experimentsheuristic algorithmsworst-case analysisnetwork optimizationexact algorithmsdense subgraphs

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Nonlinear programming (90C30) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Unnamed Item
• Unnamed Item
• The university of Florida sparse matrix collection
• Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem
• Finding Dense Subgraphs with Size Bounds
• On Finding Dense Subgraphs
• A new approach to the maximum-flow problem
• A network flow solution to some nonlinear 0-1 programming problems, with applications to graph theory
• Practical Minimum Cut Algorithms
• A Fast Parametric Maximum Flow Algorithm and Applications
• Greedily Finding a Dense Subgraph
• Discounted average degree density metric and new algorithms for the densest subgraph problem

This page was built for publication: In search of dense subgraphs: How good is greedy peeling?