Efficient First-Order Model-Checking Using Short Labels (Q3507329): Difference between revisions

@@ Property / cites work @@
+A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
+Normal rank
@@ Property / cites work @@
+Connectivity check in 3-connected planar graphs with obstacles
+Normal rank
@@ Property / cites work @@
+Upper bounds to the clique width of graphs
@@ Property / cites work: Upper bounds to the clique width of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Compact Forbidden-Set Routing
@@ Property / cites work: Compact Forbidden-Set Routing / rank @@
+Normal rank
@@ Property / cites work @@
+Query efficient implementation of graphs of bounded clique-width
+Normal rank
@@ Property / cites work @@
+First-order queries on structures of bounded degree are computable with constant delay
+Normal rank
@@ Property / cites work @@
+Generalized model-checking over locally tree-decomposable classes
+Normal rank
@@ Property / cites work @@
+Deciding first-order properties of locally tree-decomposable structures
+Normal rank
@@ Property / cites work @@
+Q3666827
@@ Property / cites work: Q3666827 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3086928
@@ Property / cites work: Q3086928 / rank @@
+Normal rank
@@ Property / cites work @@
+Compact and localized distributed data structures
@@ Property / cites work: Compact and localized distributed data structures / rank @@
+Normal rank
@@ Property / cites work @@
+Finding Branch-Decompositions and Rank-Decompositions
+Normal rank
@@ Property / cites work @@
+Linear time low tree-width partitions and algorithmic consequences
+Normal rank
@@ Property / cites work @@
+Graph minors. V. Excluding a planar graph
@@ Property / cites work: Graph minors. V. Excluding a planar graph / rank @@
+Normal rank
@@ Property / cites work @@
+Q5284545
@@ Property / cites work: Q5284545 / rank @@
+Normal rank