Trade-offs in dynamic coloring for bipartite and general graphs (Q2696273): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Fully dynamic maximal independent set with sublinear update time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4607872 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3024792 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234100 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5874328 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: An on-line graph coloring algorithm with sublinear performance ratio / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of Finite Graphs Into Forests / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple Deterministic Algorithms for Fully Dynamic Maximal Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logarithmic Lower Bounds in the Cell-Probe Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: A data structure for dynamic trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Dynamic Graph Coloring / rank
 
Normal rank

Latest revision as of 22:05, 31 July 2024

scientific article
Language Label Description Also known as
English
Trade-offs in dynamic coloring for bipartite and general graphs
scientific article

    Statements

    Trade-offs in dynamic coloring for bipartite and general graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    11 April 2023
    0 references
    0 references
    dynamic graph algorithms
    0 references
    graph coloring
    0 references
    0 references