Efficient First-Order Model-Checking Using Short Labels
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3819693 (Why is no real title available?)
- scientific article; zbMATH DE number 969067 (Why is no real title available?)
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- Compact Forbidden-Set Routing
- Compact and localized distributed data structures
- Connectivity check in 3-connected planar graphs with obstacles
- Deciding first-order properties of locally tree-decomposable structures
- Finding Branch-Decompositions and Rank-Decompositions
- First-order queries on structures of bounded degree are computable with constant delay
- Generalized model-checking over locally tree-decomposable classes
- Graph minors. V. Excluding a planar graph
- Linear time low tree-width partitions and algorithmic consequences
- Logic, graphs, and algorithms
- Query efficient implementation of graphs of bounded clique-width
- Upper bounds to the clique width of graphs
Cited in
(2)
This page was built for publication: Efficient First-Order Model-Checking Using Short Labels
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3507329)