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
206
search results - page 42 / 42
»
A distributed approximation algorithm for the minimum degree...
Sort
relevance
views
votes
recent
update
View
thumb
title
147
Voted
SPAA
2003
ACM
104
views
Distributed And Parallel Com...
»
more
SPAA 2003
»
Short length menger's theorem and reliable optical routing
15 years 9 months ago
Download
www.nd.edu
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...
Amitabha Bagchi, Amitabh Chaudhary, Petr Kolman
claim paper
Read More »
« Prev
« First
page 42 / 42
Last »
Next »