SOFSEM 2006: Theory and Practice of Computer Science

DOI10.1007/11611257MaRDI QIDQ5898003zbMATH OpenOpenAlexFDO

Authors Jiří Šíma, Satu Elisa Schaeffer

Publication date 14 November 2006

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11611257

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• ON GENERIC COMPLEXITY OF THE GRAPH CLUSTERING PROBLEM
• scientific article; zbMATH DE number 7746258
• The generic complexity of the bounded problem of graphs clustering
• On generic complexity of the graph clustering problem with bounded clusters
• scientific article; zbMATH DE number 26490
• Graphs, \(L_1\)-metrics and clustering
• On the complexity of some cluster analysis problems
• NP-hardness of the cluster minimization problem revisited
• Complexity results on graphs with few cliques
• scientific article; zbMATH DE number 4034897

Cited in

(15)

• Community detection with the label propagation algorithm: a survey
• Stagnation-aware breakout tabu search for the minimum conductance graph partitioning problem
• Graph clustering with surprise: complexity and exact solutions
• Mixed-integer linear programming formulations for the software clustering problem
• scientific article; zbMATH DE number 26490 (Why is no real title available?)
• A combinatorial model and algorithm for globally searching community structure in complex networks
• The vertex attack tolerance of complex networks
• Graph clustering
• A general view on computing communities
• ON GENERIC COMPLEXITY OF THE GRAPH CLUSTERING PROBLEM
• Iterated multilevel simulated annealing for large-scale graph conductance minimization
• Network cluster-robust inference
• Distributional limits of graph cuts on discretized grids
• Dense and sparse graph partition
• A Cheeger inequality for size-specific conductance

This page was built for publication: SOFSEM 2006: Theory and Practice of Computer Science

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