Generalized model-checking over locally tree-decomposable classes

DOI10.1007/S00224-003-1111-9MaRDI QIDQ705069zbMATH OpenOpenAlexFDO

Authors Markus Frick

Publication date 25 January 2005

Published in Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00224-003-1111-9

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• scientific article; zbMATH DE number 2086422
• Deciding first-order properties of locally tree-decomposable structures
• Publication:4938635
• Decomposing quantified conjunctive (or disjunctive) formulas
• Efficient First-Order Model-Checking Using Short Labels

Cited in

(12)

• scientific article; zbMATH DE number 1405654 (Why is no real title available?)
• Compact labelings for efficient first-order model-checking
• Data-compression for parametrized counting problems on sparse graphs
• scientific article; zbMATH DE number 2086422 (Why is no real title available?)
• Counting edge-injective homomorphisms and matchings on restricted graph classes
• Enumeration for FO Queries over Nowhere Dense Graphs
• Deciding first-order properties of locally tree-decomposable structures
• A fixed-parameter perspective on \#BIS
• Counting problems in parameterized complexity
• A fixed-parameter perspective on \#BIS
• Decomposing quantified conjunctive (or disjunctive) formulas
• Efficient First-Order Model-Checking Using Short Labels

This page was built for publication: Generalized model-checking over locally tree-decomposable classes

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