A distributed low tree-depth decomposition algorithm for bounded expansion classes (Q5964897): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00446-015-0251-x
+Normal rank
@@ Property / OpenAlex ID @@
+W1456870675
@@ Property / OpenAlex ID: W1456870675 / rank @@
+Normal rank
@@ Property / cites work @@
+Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition
+Normal rank
@@ Property / cites work @@
+Distributed $(\Delta+1)$-Coloring in Linear (in $\Delta$) Time
+Normal rank
@@ Property / cites work @@
+Rankings of Graphs
@@ Property / cites work: Rankings of Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4942652
@@ Property / cites work: Q4942652 / rank @@
+Normal rank
@@ Property / cites work @@
+Parallel \((\Delta +1)\)-coloring of constant-degree graphs
+Normal rank
@@ Property / cites work @@
+Constant-factor approximation of the domination number in sparse graphs
+Normal rank
@@ Property / cites work @@
+Algorithms for Classes of Graphs with Bounded Expansion
+Normal rank
@@ Property / cites work @@
+Testing first-order properties for subclasses of sparse graphs
+Normal rank
@@ Property / cites work @@
+A Dynamic Data Structure for MSO Properties in Graphs with Bounded Tree-Depth
+Normal rank
@@ Property / cites work @@
+Kernelization Using Structural Parameters on Sparse Graph Classes
+Normal rank
@@ Property / cites work @@
+Q3118384
@@ Property / cites work: Q3118384 / rank @@
+Normal rank
@@ Property / cites work @@
+Deciding First-Order Properties of Nowhere Dense Graphs
+Normal rank
@@ Property / cites work @@
+Q5498755
@@ Property / cites work: Q5498755 / rank @@
+Normal rank
@@ Property / cites work @@
+Enumeration of monadic second-order queries on trees
+Normal rank
@@ Property / cites work @@
+On the complexity of distributed graph coloring
@@ Property / cites work: On the complexity of distributed graph coloring / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum Dominating Set Approximation in Graphs of Bounded Arboricity
+Normal rank
@@ Property / cites work @@
+Locality in Distributed Graph Algorithms
@@ Property / cites work: Locality in Distributed Graph Algorithms / rank @@
+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 @@
+Grad and classes with bounded expansion. I: Decompositions
+Normal rank
@@ Property / cites work @@
+Grad and classes with bounded expansion. II: Algorithmic aspects
+Normal rank
@@ Property / cites work @@
+How many \(F\)'s are there in \(G\)?
@@ Property / cites work: How many \(F\)'s are there in \(G\)? / rank @@
+Normal rank
@@ Property / cites work @@
+Sparsity. Graphs, structures, and algorithms
@@ Property / cites work: Sparsity. Graphs, structures, and algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+On first-order definable colorings
@@ Property / cites work: On first-order definable colorings / rank @@
+Normal rank
@@ Property / cites work @@
+Best monotone degree conditions for graph properties: a survey
+Normal rank
@@ Property / cites work @@
+Characterisations and examples of graph classes with bounded expansion
+Normal rank
@@ Property / cites work @@
+Distributed Computing: A Locality-Sensitive Approach
+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 @@
+Locality based graph coloring
@@ Property / cites work: Locality based graph coloring / rank @@
+Normal rank
@@ Property / cites work @@
+Generalization of transitive fraternal augmentations for directed graphs and its applications
+Normal rank
@@ Property / cites work @@
+Colouring graphs with bounded generalized colouring number
+Normal rank