Distributed deterministic edge coloring using bounded neighborhood independence (Q5920296): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2016190491 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1010.2454 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3758854 / 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 (δ+1)-coloring in linear (in δ) time / 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: Q3416248 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501833 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4796186 / 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: Randomized Distributed Edge Coloring via an Extension of the Chernoff--Hoeffding Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: A randomized distributed algorithm for the maximal independent set problem in growth-bounded graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nearly optimal distributed edge coloring in O(log log n) rounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3744180 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling parallel I/O operations in multiple bus systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the locality of bounded growth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low diameter graph decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locality in Distributed Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simple distributed algorithms for sparse networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locality based graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: A log-star distributed maximal independent set algorithm for growth-bounded graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new technique for distributed symmetry breaking / rank
 
Normal rank

Latest revision as of 13:20, 7 July 2024

scientific article; zbMATH DE number 6275338
Language Label Description Also known as
English
Distributed deterministic edge coloring using bounded neighborhood independence
scientific article; zbMATH DE number 6275338

    Statements

    Distributed deterministic edge coloring using bounded neighborhood independence (English)
    0 references
    0 references
    0 references
    28 March 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    defective-coloring
    0 references
    legal-coloring
    0 references
    line-graphs
    0 references
    0 references
    0 references