Finding Dense Subgraphs with Size Bounds
Authors:
- 1 January 2009
- book chapter
- Published by Springer Nature
- p. 25-37
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Ruling Out PTAS for Graph Min‐Bisection, Dense k‐Subgraph, and Bipartite CliqueSIAM Journal on Computing, 2006
- Peeling the yeast protein networkProteomics, 2005
- Complexity of finding dense subgraphsDiscrete Applied Mathematics, 2002
- Approximation Algorithms for Maximization Problems Arising in Graph PartitioningJournal of Algorithms, 2001
- The Dense k -Subgraph ProblemAlgorithmica, 2001
- Greedily Finding a Dense SubgraphJournal of Algorithms, 2000
- Trawling the Web for emerging cyber-communitiesComputer Networks, 1999
- Generating Sparse 2-SpannersJournal of Algorithms, 1994
- A Fast Parametric Maximum Flow Algorithm and ApplicationsSIAM Journal on Computing, 1989
- Network structure and minimum degreeSocial Networks, 1983