Grad and classes with bounded expansion. II: Algorithmic aspects (Q2426457): Difference between revisions

@@ Property / arXiv ID @@
+math/0508324
@@ Property / arXiv ID: math/0508324 / rank @@
+Normal rank
@@ Property / cites work @@
+Color-coding
@@ Property / cites work: Color-coding / rank @@
+Normal rank
@@ Property / cites work @@
+Planar orientations with low out-degree and compaction of adjacency matrices
+Normal rank
@@ Property / cites work @@
+Matrix multiplication via arithmetic progressions
@@ Property / cites work: Matrix multiplication via arithmetic progressions / rank @@
+Normal rank
@@ Property / cites work @@
+Q4385531
@@ Property / cites work: Q4385531 / rank @@
+Normal rank
@@ Property / cites work @@
+The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
+Normal rank
@@ Property / cites work @@
+Q4942652
@@ Property / cites work: Q4942652 / rank @@
+Normal rank
@@ Property / cites work @@
+Excluding any graph as a minor allows a low tree-width 2-coloring
+Normal rank
@@ Property / cites work @@
+Q4886099
@@ Property / cites work: Q4886099 / rank @@
+Normal rank
@@ Property / cites work @@
+Subgraph Isomorphism in Planar Graphs and Related Problems
+Normal rank
@@ Property / cites work @@
+Diameter and treewidth in minor-closed graph families
+Normal rank
@@ Property / cites work @@
+S-functions for graphs
@@ Property / cites work: S-functions for graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4027167
@@ Property / cites work: Q4027167 / rank @@
+Normal rank
@@ Property / cites work @@
+A Separator Theorem for Planar Graphs
@@ Property / cites work: A Separator Theorem for Planar Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Geometric Separators for Finite-Element Meshes
@@ Property / cites work: Geometric Separators for Finite-Element Meshes / rank @@
+Normal rank
@@ Property / cites work @@
+Grad and classes with bounded expansion. I: Decompositions
+Normal rank
@@ Property / cites work @@
+The Grad of a Graph and Classes with Bounded Expansion
+Normal rank
@@ Property / cites work @@
+Linear time low tree-width partitions and algorithmic consequences
+Normal rank
@@ Property / cites work @@
+Tree-depth, subgraph coloring and homomorphism bounds
+Normal rank
@@ Property / cites work @@
+Q3688439
@@ Property / cites work: Q3688439 / rank @@
+Normal rank
@@ Property / cites work @@
+Small Diameters of Duals
@@ Property / cites work: Small Diameters of Duals / rank @@
+Normal rank
@@ Property / cites work @@
+Q4028099
@@ Property / cites work: Q4028099 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3128907
@@ Property / cites work: Q3128907 / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. I. Excluding a forest
@@ Property / cites work: Graph minors. I. Excluding a forest / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. XVI: Excluding a non-planar graph
@@ Property / cites work: Graph minors. XVI: Excluding a non-planar graph / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal node ranking of tree in linear time
@@ Property / cites work: Optimal node ranking of tree in linear time / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorial aspects of geometric graphs
@@ Property / cites work: Combinatorial aspects of geometric graphs / rank @@
+Normal rank