Generalized model-checking over locally tree-decomposable classes

DOI10.1007/s00224-003-1111-9zbMath1101.68727OpenAlexW2912403374MaRDI QIDQ705069

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

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

Related Items (8)

Enumeration for FO Queries over Nowhere Dense Graphs ⋮ Efficient First-Order Model-Checking Using Short Labels ⋮ Compact labelings for efficient first-order model-checking ⋮ Unnamed Item ⋮ A fixed-parameter perspective on \#BIS ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Counting edge-injective homomorphisms and matchings on restricted graph classes

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