Automated generation of search tree algorithms for hard graphs modification problems

DOI10.1007/s00453-004-1090-5zbMath1090.68027OpenAlexW2099200823MaRDI QIDQ1882409

Jens Gramm, Falk Hüffner, Jiong Guo, Rolf Niedermeier

Publication date: 1 October 2004

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-004-1090-5

Mathematics Subject Classification ID

Searching and sorting (68P10) Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10)

Related Items

Parameterized enumeration, transversals, and imperfect phylogeny reconstruction, Parameterizing edge modification problems above lower bounds, BOUNDED SEARCH TREE ALGORITHMS FOR PARAMETRIZED COGRAPH DELETION: EFFICIENT BRANCHING RULES BY EXPLOITING STRUCTURES OF SPECIAL GRAPH CLASSES, A top-down approach to search-trees: Improved algorithmics for 3-hitting set, Cluster Editing, Parameterized algorithms for min-max 2-cluster editing, A golden ratio parameterized algorithm for cluster editing, An improved fixed-parameter algorithm for 2-Club Cluster Edge Deletion, \(s\)-club cluster vertex deletion on interval and well-partitioned chordal graphs, \(s\)-club cluster vertex deletion on interval and well-partitioned chordal graphs, Exact Algorithms for Cluster Editing: Evaluation and Experiments, A \(2k\) kernel for the cluster editing problem, On making directed graphs transitive, Algorithms for 2-club cluster deletion problems using automated generation of branching rules, Even faster parameterized cluster deletion and cluster editing, Confronting intractability via parameters, Chordless Cycle Packing Is Fixed-Parameter Tractable, Parameterized algorithms for the 2-clustering problem with minimum sum and minimum sum of squares objective functions, Cluster deletion revisited, Branch-and-cut approaches for \(p\)-cluster editing, An improved parameterized algorithm for the \(p\)-cluster vertex deletion problem, Complexity and parameterized algorithms for cograph editing, Exact algorithms for cluster editing: Evaluation and experiments, Fixed-parameter enumerability of cluster editing and related problems, Branch-and-price for \(p\)-cluster editing, Even better fixed-parameter algorithms for bicluster editing, Applying modular decomposition to parameterized cluster editing problems, Polyhedral properties of the induced cluster subgraphs, Fixed-parameter algorithms for cluster vertex deletion, Generalized Graph Clustering: Recognizing (p,q)-Cluster Graphs, Faster parameterized algorithm for cluster vertex deletion, Fixed-Parameter Algorithms for Cluster Vertex Deletion, A simple and improved parameterized algorithm for bicluster editing, Triangle edge deletion on planar glasses-free RGB-digraphs, On Generating Triangle-Free Graphs, Bounded-Degree Techniques Accelerate Some Parameterized Graph Algorithms, Going weighted: parameterized algorithms for cluster editing, THE COMPUTATIONAL COMPLEXITY OF AVOIDING FORBIDDEN SUBMATRICES BY ROW DELETIONS, Going Weighted: Parameterized Algorithms for Cluster Editing, Speeding up Exact Algorithms With High Probability, A fast branching algorithm for cluster vertex deletion, An effective branching strategy based on structural relationship among multiple forbidden induced subgraphs