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
134
click to vote
IPL
2010
158
views
more
IPL 2010
»
Finding bipartite subgraphs efficiently
15 years 15 days 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 »
128
Voted
NETWORKS
2010
123
views
Computer Networks
»
more
NETWORKS 2010
»
Optical index of fault tolerant routings in WDM networks
15 years 1 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 »