Algorithms for the Densest Subgraph with at Least k Vertices and with a Specified Subset

DOI10.1007/978-3-319-26626-8_41zbMath1478.05144OpenAlexW2402507904MaRDI QIDQ3467871

Jian-Xiong Wang, Maobin Tang, Lingxi Peng, Fufang Li, Wenbin Chen

Publication date: 5 February 2016

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-26626-8_41

zbMATH Keywords

polynomial time algorithmgreedy approximation algorithm

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph algorithms (graph-theoretic aspects) (05C85) Density (toughness, etc.) (05C42)

Related Items (2)

Sparse Graphs Are Near-Bipartite ⋮ In search of the densest subgraph

Cites Work

• Unnamed Item
• Unnamed Item
• On size-constrained minimum \(s\mathrm{-}t\) cut problems and size-constrained dense subgraph problems
• Finding Dense Subgraphs with Size Bounds
• On Finding Dense Subgraphs
• Combinatorial Optimization with Rational Objective Functions
• A Fast Parametric Maximum Flow Algorithm and Applications
• The dense \(k\)-subgraph problem

This page was built for publication: Algorithms for the Densest Subgraph with at Least k Vertices and with a Specified Subset