Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics
From MaRDI portal
Publication:2827798
DOI10.1007/978-3-662-53174-7_1zbMath1417.68055arXiv1606.03268OpenAlexW2410736468MaRDI QIDQ2827798
Rolf Niedermeier, André Nichterlein, Christian Komusiewicz
Publication date: 21 October 2016
Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1606.03268
Programming involving graphs or networks (90C35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (3)
On 2-Clubs in Graph-Based Data Clustering: Theory and Algorithm Engineering ⋮ On 2-clubs in graph-based data clustering: theory and algorithm engineering ⋮ Improved kernel and algorithm for claw and diamond free edge deletion based on refined observations
Cites Work
- Win-win kernelization for degree sequence completion problems
- Incremental list coloring of graphs, parameterized by conservation
- Local search: is brute-force avoidable?
- Graph-based data clustering with overlaps
- Heuristic algorithms in computational molecular biology
- Graph-modeled data clustering: Exact algorithms for clique generation
- On the parameterized complexity of dynamic problems
- The complexity of degree anonymization by vertex addition
- Fixed-parameter algorithms for cluster vertex deletion
- Which problems have strongly exponential complexity?
- A clustering algorithm based on graph connectivity
- On the parameterized complexity of consensus clustering
- Clustering with partial information
- A refined complexity analysis of degree anonymization in graphs
- Approximation and tidying -- a problem kernel for \(s\)-plex cluster vertex deletion
- On Editing Graphs into 2-Club Clusters
- Editing Simple Graphs
- The Complexity of Degree Anonymization by Graph Contractions
- A More Relaxed Model for Graph-Based Data Clustering: s-Plex Cluster Editing
- Parameterizing above Guaranteed Values: MaxSat and MaxCut
- Properties of vertex packing and independence system polyhedra
- Faster Parameterized Algorithms Using Linear Programming
- A Graph-Theoretic Approach to a Communications Problem
- Algorithms and Data Structures
- Finding large degree-anonymous subgraphs is hard
This page was built for publication: Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics
