Clustering with Local Restrictions

DOI10.1007/978-3-642-22006-7_66zbMath1333.68148arXiv1711.03885MaRDI QIDQ3012850

Dániel Marx, Daniel Lokshtanov

Publication date: 6 July 2011

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1711.03885

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68R10: Graph theory (including graph drawing) in computer science

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

68W20: Randomized algorithms

Related Items

Unnamed Item, FPT Suspects and Tough Customers: Open Problems of Downey and Fellows, Generalized Graph Clustering: Recognizing (p,q)-Cluster Graphs, Important Separators and Parameterized Algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Correlation clustering
• Parameterized graph separation problems
• On algorithmic applications of the immersion order: An overview of ongoing work presented at the Third Slovenian International Conference on Graph Theory
• Clustering with local restrictions
• Generalized Graph Clustering: Recognizing (p,q)-Cluster Graphs
• Dynamic Programming Treatment of the Travelling Salesman Problem
• A fixed-parameter algorithm for the directed feedback vertex set problem
• Almost 2-SAT Is Fixed-Parameter Tractable (Extended Abstract)
• An Improved Parameterized Algorithm for the Minimum Node Multiway Cut Problem
• Color-coding
• Fixed-parameter tractability of multicut parameterized by the size of the cutset
• Aggregating inconsistent information