scientific article; zbMATH DE number 2011857
From MaRDI portal
Publication:4437509
zbMath1032.68121MaRDI QIDQ4437509
Sven Kosub, Klaus Holzapfel, Hanjo Täubig, Moritz G. Maaß
Publication date: 2 December 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2653/26530201.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs ⋮ Graph clustering ⋮ The complexity of detecting fixed-density clusters ⋮ A polynomial algorithm for the k-cluster problem on the interval graphs
