SOFSEM 2006: Theory and Practice of Computer Science
From MaRDI portal
Publication:5898003
DOI10.1007/11611257zbMath1175.68284OpenAlexW2756057450MaRDI QIDQ5898003
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
Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
Community detection with the label propagation algorithm: a survey, Mixed-integer linear programming formulations for the software clustering problem, The vertex attack tolerance of complex networks, Iterated multilevel simulated annealing for large-scale graph conductance minimization, A combinatorial model and algorithm for globally searching community structure in complex networks, Graph clustering, A general view on computing communities, Dense and sparse graph partition, Stagnation-aware breakout tabu search for the minimum conductance graph partitioning problem