Query efficient implementation of graphs of bounded clique-width (Q1408820): Difference between revisions

@@ Property / cites work @@
+A partial k-arboretum of graphs with bounded treewidth
+Normal rank
@@ Property / cites work @@
+Shortest paths in digraphs of small treewidth. II: Optimal parallel algorithms
+Normal rank
@@ Property / cites work @@
+Shortest paths in digraphs of small treewidth. I: Sequential algorithms
+Normal rank
@@ Property / cites work @@
+Fundamental properties of infinite trees
@@ Property / cites work: Fundamental properties of infinite trees / rank @@
+Normal rank
@@ Property / cites work @@
+Monadic second-order definable graph transductions: a survey
+Normal rank
@@ Property / cites work @@
+Handbook of Graph Grammars and Computing by Graph Transformation
+Normal rank
@@ Property / cites work @@
+On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic
+Normal rank
@@ Property / cites work @@
+Monadic second-order evaluations on tree-decomposable graphs
+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 @@
+Monadic second-order logic, graph coverings and unfoldings of transition systems
+Normal rank
@@ Property / cites work @@
+Q2768294
@@ Property / cites work: Q2768294 / rank @@
+Normal rank
@@ Property / cites work @@
+Dynamic algorithms for graphs of bounded treewidth
+Normal rank
@@ Property / cites work @@
+Q4385530
@@ Property / cites work: Q4385530 / rank @@
+Normal rank