Clustering with local restrictions
From MaRDI portal
Publication:1951587
DOI10.1016/j.ic.2012.10.016zbMath1266.05122OpenAlexW2089657800MaRDI QIDQ1951587
Dániel Marx, Daniel Lokshtanov
Publication date: 6 June 2013
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2012.10.016
Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (10)
Finding all leftmost separators of size \(\le k\) ⋮ Designing FPT Algorithms for Cut Problems Using Randomized Contractions ⋮ Covering Vectors by Spaces: Regular Matroids ⋮ On the complexity of multi-parameterized cluster editing ⋮ Parameterized complexity of weighted multicut in trees ⋮ Parameterized complexity of multicut in weighted trees ⋮ A survey of parameterized algorithms and the complexity of edge modification ⋮ Clustering with Local Restrictions ⋮ List H-coloring a graph by removing few vertices ⋮ Posimodular function optimization
This page was built for publication: Clustering with local restrictions
