Parameterized algorithms for module map problems

DOI10.1016/j.dam.2020.01.029zbMath1442.05226OpenAlexW3021760796MaRDI QIDQ5918889

Christian Komusiewicz, Frank Sommer

Publication date: 29 June 2020

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2020.01.029

zbMATH Keywords

graph classeskernelizationgraph modification problemsearch tree algorithmmultilayer graphs

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Destroying Bicolored $P_3$s by Deleting Few Edges

Cites Work

• Fundamentals of parameterized complexity
• Exact algorithms for cluster editing: Evaluation and experiments
• Exact exponential algorithms.
• Correlation clustering
• Cluster editing with locally bounded modifications
• Graph-modeled data clustering: Exact algorithms for clique generation
• On miniaturized problems in parameterized complexity theory
• Going weighted: parameterized algorithms for cluster editing
• NP-hard problems in hierarchical-tree clustering
• Parameterizing edge modification problems above lower bounds
• Cluster graph modification problems
• Destroying bicolored \(P_3\)s by deleting few edges
• Tight bounds for parameterized complexity of Cluster Editing
• Color-coding
• Multiplying matrices faster than coppersmith-winograd
• Parameterized Algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Parameterized algorithms for module map problems