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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00446-015-0251-x / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00446-015-0251-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1456870675 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed $(\Delta+1)$-Coloring in Linear (in $\Delta$) Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rankings of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4942652 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel \((\Delta +1)\)-coloring of constant-degree graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant-factor approximation of the domination number in sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Classes of Graphs with Bounded Expansion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing first-order properties for subclasses of sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dynamic Data Structure for MSO Properties in Graphs with Bounded Tree-Depth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernelization Using Structural Parameters on Sparse Graph Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3118384 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding First-Order Properties of Nowhere Dense Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5498755 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration of monadic second-order queries on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of distributed graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Dominating Set Approximation in Graphs of Bounded Arboricity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locality in Distributed Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Grad of a Graph and Classes with Bounded Expansion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time low tree-width partitions and algorithmic consequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree-depth, subgraph coloring and homomorphism bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Grad and classes with bounded expansion. I: Decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Grad and classes with bounded expansion. II: Algorithmic aspects / rank
 
Normal rank
Property / cites work
 
Property / cites work: How many \(F\)'s are there in \(G\)? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparsity. Graphs, structures, and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On first-order definable colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Best monotone degree conditions for graph properties: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterisations and examples of graph classes with bounded expansion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Computing: A Locality-Sensitive Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal node ranking of tree in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locality based graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalization of transitive fraternal augmentations for directed graphs and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colouring graphs with bounded generalized colouring number / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00446-015-0251-X / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:27, 9 December 2024

scientific article; zbMATH DE number 6547982
Language Label Description Also known as
English
A distributed low tree-depth decomposition algorithm for bounded expansion classes
scientific article; zbMATH DE number 6547982

    Statements

    A distributed low tree-depth decomposition algorithm for bounded expansion classes (English)
    0 references
    1 March 2016
    0 references
    distributed algorithm
    0 references
    graph theory
    0 references
    low tree-depth decomposition
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references