The complexity of detecting fixed-density clusters

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2653, Issue , 2003, Pages 201-212

  Holzapfel, Klaus ^a   Kosub, Sven ^a   Maaß, Moritz G ^a   Täubig, Hanjo ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

Computational complexity; Density based clustering; Fixed parameter problems; Graph algorithms

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; POLYNOMIAL APPROXIMATION; POLYNOMIALS;

CLIQUE PROBLEMS; DENSITY CLUSTERS; DENSITY-BASED CLUSTERING; FIXED-PARAMETER PROBLEMS; GRAPH ALGORITHMS; POLYNOMIAL-TIME ALGORITHMS; SHARP BOUNDARIES; UNDIRECTED GRAPH;

CLUSTERING ALGORITHMS;

EID: 35248816402     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44849-7_25     Document Type: Article

References (22)

1. Y. Asahiro, R. Hassin, and K. Iwama. Complexity of finding dense subgraphs. Discrete Applied Mathematics, 121(1-3):15-26, 2002.
2. Y. Asahiro, K. Iwama, H. Tamaki, and T. Tokuyama. Greedily finding a dense subgraph. Journal of Algorithms, 34(2):203-221, 2000.
3. C. J. Alpert and A. B. Kahng. Recent developments in netlist partitioning: A survey. Integration: The VLSI Journal, 19(1-2):1-81, 1995.
4. S. Arora, D. Karger, and M. Karpinski. Polynomial time approximation schemes for dense instances of NP-hard problems. Journal of Computer and System Sciences, 58(1):193-210, 1999.
5. R. B. Boppana and M. M. Halldorsson. Approximating maximum independent sets by excluding subgraphs. BIT, 32(2):180-196, 1992.
6. M. S. Charikar. Greedy approximation algorithms for finding dense components in a graph. In Proceedings 3rd International Workshop on Approximation Algorithms for Combinatorial Optimization, volume 1913 of Lecture Notes in Computer Science, pages 84-95. Springer-Verlag, Berlin, 2000.
7. J. Cong and M. Smith. A parallel bottom-up clustering algorithm with applications to circuit partitioning in VLSI design. In Proceedings 30th ACM/IEEE Design Automation Conference, pages 755-760. ACM Press, New York, 1993.
8. A. Czygrinow. Maximum dispersion problem in dense graphs. Operations Research Letters, 27(5):223-227, 2000.
9. U. Faigle and W. Kern. Computational complexity of some maximum average weight problems with precedence constraints. Operations Research, 42(4):1268-1272, 1994.
10. U. Feige, G. Kortsarz, and D. Peleg. The dense k-subgraph problem. Algorithmica, 29(3):410-421, 2001.
11. U. Feige and M. Seltser. On the densest k-subgraph problem. Technical Report CS97-16, Department of Applied Mathematics and Computer Science, The Weizmann Institute of Science, Rehovot, Israel, 1997.
12. G. Gallo, M. D. Grigoriadis, and R. E. Tarjan. A fast parametric maximum flow algorithm and applications. SIAM Journal on Computing, 18(1):30-55, 1989.
13. O. Goldschmidt, D. Nehme, and G. Yu. On the set union knapsack problem. Naval Research Logistics, 41(6):833-842, 1994.
14. 1-ε. Acta Mathematica, 182(1):105-142, 1999.
15. K. Holzapfel, S. Kosub, M. G. Maaβ, and H. Täubig. The complexity of detecting fixed-density clusters. Technical Report TUM-I0212, Fakultät für Informatik, Technische Universität München, 2002.
16. D. J.-H. Huang and A. B. Kahng. When cluster meet partitions: New density-based methods for circuit decomposition. In Proceedings European Design and Test Conference, pages 60-64. IEEE Computer Society Press, Los Alamitos, 1995.
17. J. M. Kleinberg, S. R. Kumar, P. Raghavan, S. Rajagopalan, and A. S. Tomkins. The Web as a graph: measurements, models, and methods. In Proceedings 5th International Conference on Computing and Combinatorics, volume 1627 of Lecture Notes in Computer Science, pages 1-17. Springer-Verlag, Berlin, 1999.
18. S. R. Kumar, P. Raghavan, S. Rajagopalan, and A. S. Tomkins. Trawling the Web for emerging cyber-communities. Computer Networks, 31(3):1481-1493, 1999.
19. T. Murata. Discovery of Web communities based on the co-occurrence of references. In Proceedings 3th International Conference on Discovery Science, volume 1967 of Lecture Notes in Artificial Intelligence, pages 65-75. Springer-Verlag, Berlin, 2000.
20. D. Nehme and G. Yu. The cardinality and precedence constrained maximum value sub-hypergraph problem and its applications. Discrete Applied Mathematics, 74(1):57-68, 1997.
21. A. Srivastav and K. Wolf. Finding dense subgraphs with semidefinite programming. In Proceedings International Workshop on Approximation Algorithms for Combinatorial Optimization, volume 1444 of Lecture Notes in Computer Science, pages 181-191. Springer-Verlag, Berlin, 1998.
22. P. Turán. On an extremal problem in graph theory. Matematikai és Fizikai Lapok, 48:436-452, 1941. In Hungarian.