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
26
search results - page 6 / 6
»
Deterministic distributed vertex coloring in polylogarithmic...
Sort
relevance
views
votes
recent
update
View
thumb
title
23
click to vote
DC
2010
208
views
Internet Technology
»
more
DC 2010
»
An optimal maximal independent set algorithm for bounded-independence graphs
13 years 5 months ago
Download
dcg.ethz.ch
We present a novel distributed algorithm for the maximal independent set (MIS) problem.1 On bounded-independence graphs (BIG) our deterministic algorithm finishes in O(log n) time,...
Johannes Schneider, Roger Wattenhofer
claim paper
Read More »
« Prev
« First
page 6 / 6
Last »
Next »