Skip to main navigation
Skip to search
Skip to main content
Open University of Israel Home
Pure Tutorial for OUI staff
English
עברית
العربية
Home
Researchers
Research units
Research outputs
Prizes
Activities
Search by expertise, name or affiliation
Combinatorial algorithms for distributed graph coloring
Leonid Barenboim
, Michael Elkin
Research output
:
Contribution to journal
›
Article
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Combinatorial algorithms for distributed graph coloring'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Mathematics
Combinatorial Algorithms
100%
Graph Coloring
93%
Set Systems
28%
Color
28%
Vertex Coloring
27%
Colouring
19%
Sensor Networks
16%
Graph in graph theory
15%
Arboricity
15%
Maximal Independent Set
15%
Expander
14%
Computing
14%
Communication Networks
13%
Shortest path
12%
Trade-offs
11%
Computer Science
10%
Maximum Degree
10%
Resources
10%
Communication
10%
Life
10%
Efficient Algorithms
9%
Entire
9%
Distinct
8%
Range of data
7%
Theorem
4%
Engineering & Materials Science
Coloring
95%
Color
17%
Computer science
8%
Machinery
7%
Telecommunication networks
7%
Sensor networks
6%
Set theory
5%
Communication
4%