Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
86
search results - page 18 / 18
»
On the Maximum Degree of a Random Planar Graph
Sort
relevance
views
votes
recent
update
View
thumb
title
39
click to vote
PODC
2010
ACM
142
views
Distributed and Parallel Com...
»
more
PODC 2010
»
Deterministic distributed vertex coloring in polylogarithmic time
14 years 2 months ago
Download
www.cs.bgu.ac.il
Consider an n-vertex graph G = (V, E) of maximum degree ∆, and suppose that each vertex v ∈ V hosts a processor. The processors are allowed to communicate only with their neig...
Leonid Barenboim, Michael Elkin
claim paper
Read More »
« Prev
« First
page 18 / 18
Last »
Next »