Automated generation of search tree algorithms for graph modification problems

DOI10.1007/B13632MaRDI QIDQ5897283zbMATH OpenOpenAlexFDO

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

Publication date 3 March 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b13632

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Nonnumerical algorithms (68W05)

Recommendations

• Automated generation of search tree algorithms for hard graphs modification problems
• A novel branching strategy for parameterized graph modification problems
• Finding good tree decompositions by local search
• Graph-modeled data clustering: Exact algorithms for clique generation
• Algorithms and Computation

Cited in

(2)

• Automated generation of search tree algorithms for hard graphs modification problems
• A hybrid graph representation for recursive backtracking algorithms

Describes a project that uses

Uses Software

• nauty

This page was built for publication: Automated generation of search tree algorithms for graph modification problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5897283)