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
2
search results - page 1 / 1
»
Covering Two-Edge-Coloured Complete Graphs with Two Disjoint...
Sort
relevance
views
votes
recent
update
View
thumb
title
110
click to vote
CPC
2008
114
views
more
CPC 2008
»
Covering Two-Edge-Coloured Complete Graphs with Two Disjoint Monochromatic Cycles
15 years 3 months ago
Download
www.cdam.lse.ac.uk
In 1998 Luczak, R
Peter Allen
claim paper
Read More »
140
click to vote
NETWORKS
2007
90
views
Computer Networks
»
more
NETWORKS 2007
»
Vertex disjoint routings of cycles over tori
15 years 2 months ago
Download
hal.archives-ouvertes.fr
We study the problem of designing a survivable WDM network based on covering the communication requests with subnetworks that are protected independently from each other. We consi...
Jean-Claude Bermond, Min-Li Yu
claim paper
Read More »
« Prev
« First
page 1 / 1
Last »
Next »