On the Locality of Nash-Williams Forest Decomposition and Star-Forest Decomposition (Q6098462): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The star arboricity of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Star arboricity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The star-arboricity of the complete regular multipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast distributed network decompositions and covers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Primal-Dual Graph Algorithms for MapReduce / 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: Deterministic Distributed Vertex Coloring in Polylogarithmic Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Graph Coloring: Fundamentals and Recent Developments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Massively Parallel Computation of Matching and MIS in Sparse Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple greedy algorithm for dynamic graph orientation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast distributed algorithm for \((\Delta+1)\)-edge-coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space- and Time-Efficient Algorithm for Maintaining Dense Subgraphs on One-Pass Dynamic Streams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3024792 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4608064 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2753729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed algorithms for the Lovász local lemma and graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic coin tossing with applications to optimal parallel list ranking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near-optimal, distributed edge colouring via the nibble method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed strong diameter network decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: (2Δ — l)-Edge-Coloring is Much Easier than Maximal Matching in the Distributed Setting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3682487 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forests, frames, and games: Algorithms for matroid sums and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Parametric Maximum Flow Algorithm and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Distributed Delta-Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of local distributed graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic distributed edge-coloring with fewer colors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Degree Splitting, Edge Coloring, and Orientations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maintaining Assignments Online: Matching, Scheduling, and Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the degrees of the vertices of a directed graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Local Approximation Algorithms for Maximum Matching in Graphs and Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: NETWORK-FLOW ALGORITHMS FOR LOWER-TRUNCATED TRANSVERSAL POLYMATROIDS / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Finding Dense Subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orienting Fully Dynamic Graphs with Worst-Case Time Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Scheme for Lowest Outdegree Orientation and Graph Density Measures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Deterministic Distributed Coloring Through Recursive List Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locality in Distributed Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low diameter graph decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Densest Subgraph in Dynamic Graph Streams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of Finite Graphs Into Forests / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized Distributed Edge Coloring via an Extension of the Chernoff--Hoeffding Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: A network flow solution to some nonlinear 0-1 programming problems, with applications to graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on Finding Minimum-Cost Edge-Disjoint Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polylogarithmic-time deterministic network decomposition and distributed derandomization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dense Subgraphs on Dynamic Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near-optimal fully dynamic densest subgraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on list arboricity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards the locality of Vizing’s theorem / rank
 
Normal rank

Latest revision as of 08:32, 1 August 2024

scientific article; zbMATH DE number 7695683
Language Label Description Also known as
English
On the Locality of Nash-Williams Forest Decomposition and Star-Forest Decomposition
scientific article; zbMATH DE number 7695683

    Statements

    On the Locality of Nash-Williams Forest Decomposition and Star-Forest Decomposition (English)
    0 references
    0 references
    0 references
    0 references
    14 June 2023
    0 references
    26 March 2024
    0 references
    arboricity
    0 references
    LOCAL algorithm
    0 references
    star-arboricity
    0 references
    forest decomposition
    0 references
    forest decompositions
    0 references
    graph algorithms
    0 references
    local algorithms
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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