Algorithmic Meta-theorems

DOI10.1007/978-3-540-79723-4_3MaRDI QIDQ3503574zbMATH OpenOpenAlexFDO

Authors Stephan Kreutzer

Publication date 5 June 2008

Published in Parameterized and Exact Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-79723-4_3

Mathematics Subject Classification ID

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

Recommendations

• Algorithmic meta-theorems
• Methods for algorithmic meta theorems
• scientific article; zbMATH DE number 5063195
• scientific article; zbMATH DE number 4047713
• Abstract algebraic structure of analytic theory of algorithms
• scientific article; zbMATH DE number 3858395
• A gentle introduction to applications of algorithmic metatheorems for space and circuit classes
• Algorithmic meta theorems for circuit classes of constant and logarithmic depth

Cited in

(16)

• On the width of regular classes of finite structures
• An approval-based model for single-step liquid democracy
• On (uniform) hierarchical decompositions of finite structures and model-theoretic geometry
• Logic, graphs, and algorithms
• Methods for algorithmic meta theorems
• Algorithmic meta-theorems
• Extension complexity, MSO logic, and treewidth
• Confronting intractability via parameters
• Algorithmic meta theorems for sparse graph classes
• A Retrospective on (Meta) Kernelization
• Data-compression for parametrized counting problems on sparse graphs
• 2009 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '09
• First-Order Model-Checking in Random Graphs and Complex Networks
• On Completeness of Cost Metrics and Meta-Search Algorithms in $-Calculus
• Compact labelings for efficient first-order model-checking
• Twin-treewidth: a single-exponential logic-based approach

This page was built for publication: Algorithmic Meta-theorems

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