Algorithms for the densest subgraph with at least k vertices and with a specified subset

DOI10.1007/978-3-319-26626-8_41MaRDI QIDQ3467871zbMATH OpenOpenAlexFDO

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

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

greedy approximation algorithmpolynomial time algorithm

Mathematics Subject Classification ID

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

Recommendations

• Finding Dense Subgraphs with Size Bounds
• On Finding Dense Subgraphs
• The dense \(k\)-subgraph problem
• Greedily finding a dense subgraph
• Determination of the densest subgraph

Cites work

• A Fast Parametric Maximum Flow Algorithm and Applications
• Combinatorial Optimization with Rational Objective Functions
• Finding Dense Subgraphs with Size Bounds
• scientific article; zbMATH DE number 1670532 (Why is no real title available?)
• scientific article; zbMATH DE number 1182772 (Why is no real title available?)
• On Finding Dense Subgraphs
• On size-constrained minimum \(s\mathrm{-}t\) cut problems and size-constrained dense subgraph problems
• The dense \(k\)-subgraph problem

Cited in

(10)

• Exact and superpolynomial approximation algorithms for the \textsc{densest \textit{K}-subgraph} problem
• In search of the densest subgraph
• Computing the \(k\) densest subgraphs of a graph
• A deterministic approximation algorithm for the densest \(k\)-subgraph problem
• Exact algorithms for problems related to the densest \(k\)-set problem
• Finding Dense Subgraphs with Size Bounds
• The densest subgraph problem with a convex/concave size function
• Greedily Finding a Dense Subgraph
• Sparse graphs are near-bipartite
• On size-constrained minimum \(s\mathrm{-}t\) cut problems and size-constrained dense subgraph problems

This page was built for publication: Algorithms for the densest subgraph with at least \(k\) vertices and with a specified subset

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3467871)