Skip to main navigation
Skip to search
Skip to main content
Ben-Gurion University Research Portal Home
Help & FAQ
Home
Profiles
Research output
Research units
Prizes
Press/Media
Student theses
Activities
Research Labs / Equipment
Datasets
Projects
Search by expertise, name or affiliation
Distributed Graph Coloring: Fundamentals and Recent Developments
Leonid Barenboim,
Michael Elkin
Department of Computer Science
Research output
:
Book/Report
›
Book
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Distributed Graph Coloring: Fundamentals and Recent Developments'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Symmetry Breaking
100%
Distributed Graph Coloring
100%
Distributed Computing
75%
Polylogarithmic Time
75%
Coloring Algorithm
50%
Randomized Algorithms
50%
Message Passing Model
50%
Maximal Independent Set
50%
Distributed Symmetry Breaking
50%
Communication Networks
25%
Maximum Degree
25%
Color number
25%
Graph Coloring
25%
Large Families
25%
Graph Families
25%
General Graphs
25%
Eighties
25%
Maximal Matching
25%
2-color
25%
2-coloring
25%
Computer Science
Graph Coloring
100%
Distributed Computing
100%
Randomized Algorithm
66%
Message Passing
66%
Maximal Independent Set
66%
Efficient Algorithm
33%
Communication Network
33%
Fundamental Question
33%
Maximal Matching
33%