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
47
click to vote
IPL
2010
158
views
more
IPL 2010
»
Finding bipartite subgraphs efficiently
13 years 8 months ago
Download
www.math.uic.edu
Polynomial algorithms are given for the following two problems:
Dhruv Mubayi, György Turán
claim paper
Read More »
40
click to vote
NETWORKS
2010
123
views
Computer Networks
»
more
NETWORKS 2010
»
Optical index of fault tolerant routings in WDM networks
13 years 10 months ago
Download
www.lirmm.fr
Maˇnuch and Stacho [7] introduced the problem of designing f-tolerant routings in optical networks, i.e., routings which still satisfy the given requests even if f failures occur...
Stéphane Bessy, Clément Lepelletier
claim paper
Read More »