Generalized model-checking over locally tree-decomposable classes

DOI10.1007/S00224-003-1111-9zbMATH Open1101.68727OpenAlexW2912403374MaRDI QIDQ705069FDOQ705069

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

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

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)

Cited In (12)

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

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)