The Complexity of Detecting Fixed-Density Clusters

The Complexity of Detecting Fixed-Density Clusters

Cached

Download Links

by Klaus Holzapfel , Sven Kosub , Moritz G. Maaß , Hanjo Täubig

Citations:

BibTeX

@MISC{Holzapfel_thecomplexity,
    author = {Klaus Holzapfel and Sven Kosub and Moritz G. Maaß and Hanjo Täubig},
    title = {The Complexity of Detecting Fixed-Density Clusters},
    year = {}
}

Bookmark

OpenURL

Abstract

Citations

257	The Web as a Graph: Measurements, Models and Methods - Kleinberg, Kumar, et al. - 1999
257	Trawling the web for emerging cyber-communities - Kumar, Raghavan, et al. - 1999
153	Polynomial time approximation schemes for dense instances of NP-hard problems - Arora, Karger, et al. - 1995
122	Approximating maximum independent sets by excluding subgraphs - Boppana, Halldorsson - 1992
110	On the densest k-subgraph problems - Feige, Seltser - 1997
95	A fast parametric maximum flow algorithm and applications - Gallo, Grigoriadis, et al. - 1989
64	Clique is hard to approximate within n 1 - Hastad - 1999
64	Trawling the web for emerging cyber-communities. Computer Networks - Kumar, Raghavan, et al. - 1999
56	Clique is hard to approximate within n 1−ε - H˚astad - 1999
53	A parallel bottom-up clustering algorithm with - Cong, Smith
38	Complexity of finding dense subgraphs - Asahiro, Hassin, et al.
28	Greedy approximation algorithms for finding dense components in a graph - Charikar - 2000
24	The dense k-subgraph problem. Algorithmica - Feige, Kortsarz, et al. - 2001
23	Recent Developments in Netlist Partitioning: A survey - Alpert, Kahng - 1995
21	Finding dense subgraphs with semidefinite programming, Approximation Algorithms for Combinatorial Optimization - Srivastav, Wolf - 1998
12	When cluster meet partitions: New density-based methods for circuit decomposition - Huang, Kahng - 1995
11	Clique is hard to approximate within n1 - Hastad - 1996
10	Clique is hard to approximate within n 1\Gamma - Hastad - 1999
7	On an extremal problem in graph theory, Matematikai és Fizikai Lapok 48 - Turán - 1941
5	Greedily a dense subgraph - Asahiro, Iwama, et al. - 1996
5	Maximum dispersion problem in dense graphs - Czygrinow - 2000
4	Computational complexity of some maximum average weight problems with precedence constraints - Faigle, Kern - 1994
4	Discovery of Web communities based on the co-occurrence of references - Murata - 2000
2	Greedy approximation algorithms for dense components in a graph - Charikar - 2000
2	A fast parametric maximum algorithm and applications - Gallo, Grigoriadis, et al. - 1989
2	On the set union knapsack problem - Goldschmidt, Nehme, et al. - 1994
1	Complexity of dense subgraphs. Discrete Applied Mathematics - Asahiro, Hassin, et al. - 2002
1	Complexity of finding dense subgraphs. Discrete Applied Mathematics - Asahiro, Hassin, et al. - 2002
1	The cardinality and precedence constrained maximum value subhypergraph problem and its applications. Discrete Applied Mathematics - Nehme, Yu - 1997