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
2
search results - page 1 / 1
»
Routing a Permutation in the Hypercube by Two Sets of Edge-D...
Sort
relevance
views
votes
recent
update
View
thumb
title
17
click to vote
IPPS
1996
IEEE
92
views
Distributed And Parallel Com...
»
more
IPPS 1996
»
Routing a Permutation in the Hypercube by Two Sets of Edge-Disjoint Paths
13 years 11 months ago
Download
ipdps.cc.gatech.edu
Qian-Ping Gu, Hisao Tamaki
claim paper
Read More »
20
click to vote
SPAA
2003
ACM
104
views
Distributed And Parallel Com...
»
more
SPAA 2003
»
Short length menger's theorem and reliable optical routing
14 years 18 days 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 1 / 1
Last »
Next »