Near-optimal, distributed edge colouring via the nibble method (Q1274333): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Devdatt P. Dubhashi / rank
Normal rank
 
Property / author
 
Property / author: Devdatt P. Dubhashi / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nearly perfect matchings in regular simple hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4004078 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulating (log <sup>c</sup> <i>n</i> )-wise independence in NC / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-theoretic parameters concerning domination, independence, and irredundance / rank
 
Normal rank
Property / cites work
 
Property / cites work: (Probabilistic) recurrence relations revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near perfect coverings in graphs and hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP completeness of finding the chromatic index of regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Large Deviation Inequality for Functions of Independent, Multi-Way Choices / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-Completeness of Edge-Coloring / 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: Coloring nearly-disjoint hypergraphs with \(n + o(n)\) colors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient parallel algorithms for edge coloring problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Ramsey number <i>R</i>(3, <i>t</i>) has order of magnitude <i>t</i><sup>2</sup>/log <i>t</i> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds for static resource allocation in a distributed system / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3496342 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4856179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The local nature of \(\Delta\)-coloring and its algorithmic applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic behavior of the chromatic index for hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a packing and covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotically good coverings / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0304-3975(98)00022-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2052354487 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:21, 30 July 2024

scientific article
Language Label Description Also known as
English
Near-optimal, distributed edge colouring via the nibble method
scientific article

    Statements

    Near-optimal, distributed edge colouring via the nibble method (English)
    0 references
    0 references
    0 references
    0 references
    12 January 1999
    0 references
    edge colouring
    0 references
    distributed algorithms
    0 references
    randomized algorithms
    0 references
    large deviation inequalities
    0 references

    Identifiers