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
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
6
search results - page 2 / 2
»
Computing maximal cliques in link streams
Sort
relevance
views
votes
recent
update
View
thumb
title
275
click to vote
SPAA
2012
ACM
244
views
Distributed And Parallel Com...
»
more
SPAA 2012
»
Allowing each node to communicate only once in a distributed system: shared whiteboard models
13 years 8 months ago
Download
www.dim.uchile.cl
In this paper we study distributed algorithms on massive graphs where links represent a particular relationship between nodes (for instance, nodes may represent phone numbers and ...
Florent Becker, Adrian Kosowski, Nicolas Nisse, Iv...
claim paper
Read More »
« Prev
« First
page 2 / 2
Last »
Next »