Rankings
Publications
Search Publications
Cited-by Search
Sources
Publishers
Scholars
Scholars
Top Cited Scholars
Organizations
About
Scilit
About Us
Advisory Board
Data Sources
Career
Support / Contact
User Guide
Publisher User
Search Function
Rankings Function
API Resource
Scilit Knowledge
Metrics
Scilit Recognitions
Publications Classification
Media
News
Blog
Login
Register
Home
Publications
Nearly optimal distributed edge coloring in O(log log n) rounds
Home
Publications
Nearly optimal distributed edge coloring in O(log log n) rounds
Nearly optimal distributed edge coloring in O(log log n) rounds
Authors:
DG
David A. Grable
David A. Grable
AP
Alessandro Panconesi
Alessandro Panconesi
Article Alert
Citation Alert
Add to Library
Cite
Download
Share
Download
Download PDF
Download
Publisher website
Google Scholar
1 May 1997
journal article
research article
Published by
Wiley
in
Random Structures & Algorithms
Vol. 10
(3)
,
385-405
DOI:
10.1002/(sici)1098-2418(199705)10:3<385::aid-rsa6>3.3.co;2-3
Abstract
No abstract available
Keywords
OPTIMAL
EXTREMELY
EDGE
COLORS
LOG LOG
ROUNDS
DISTRIBUTED
STRUCT
Cited
Cited by 14 articles
Scroll to top