Randomized Distributed Edge Coloring via an Extension of the Chernoff--Hoeffding Bounds

Certain types of routing, scheduling, and resource-allocation problems in a distributed setting can be modeled as edge-coloring problems. We present fast and simple randomized algorithms for edge coloring a graph in the synchronous distributed point-to-point model of computation. Our algorithms comp...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	SIAM journal on computing Ročník 26; číslo 2; s. 350 - 368
Hlavní autoři:	Panconesi, Alessandro, Srinivasan, Aravind
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Philadelphia, PA Society for Industrial and Applied Mathematics 01.03.1997
Témata:	Algorithmics. Computability. Computer arithmetics Algorithms Applied sciences Codes Combinatorial probability Combinatorics Combinatorics. Ordered structures Communication Computer science Computer science; control theory; systems Distributed processing Exact sciences and technology Graph theory Information retrieval. Graph Mathematics Probability Probability and statistics Probability theory and stochastic processes Random variables Scholarships & fellowships Sciences and techniques of general use Theoretical computing Edge(graph) Tail probability Graph node Resource allocation Graph theory Parallel algorithms Large deviation Randomization Algorithm performance Correlation analysis Distributed algorithm Graph colouring Fast algorithm
ISSN:	0097-5397, 1095-7111
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!