Symmetry breaking depending on the chromatic number or the neighborhood growth (Q392191): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: H. S. Yoon / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68R10 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C15 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C69 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C85 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W15 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W20 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W40 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6244717 / 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.1016/j.tcs.2012.09.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2023634316 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast and simple randomized parallel algorithm for the maximal independent set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: New approximation guarantee for chromatic number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of network synchronization / 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: New approximation algorithms for graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chromatic number, girth and maximal degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of distributed graph coloring with local minimality constraints / 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: Fast Distributed Algorithms for Brooks–Vizing Colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple distributed \(\Delta+1\)-coloring of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast parallel algorithm to color a graph with Δ colors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toward more localized local algorithms / 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: Locality in Distributed Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simple Parallel Algorithm for the Maximal Independent Set Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768357 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast randomized algorithms for distributed edge 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
Property / cites work
 
Property / cites work: Trading Bit, Message, and Time Complexity of Distributed Algorithms / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 05:05, 7 July 2024

scientific article
Language Label Description Also known as
English
Symmetry breaking depending on the chromatic number or the neighborhood growth
scientific article

    Statements

    Symmetry breaking depending on the chromatic number or the neighborhood growth (English)
    0 references
    0 references
    0 references
    13 January 2014
    0 references
    0 references

    Identifiers

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