Sciweavers

    SIROCCO
    2003
    109views Information Technology» more  SIROCCO 2003»
    Polynomial-Time Computable Backup Tables for Shortest-Path Routing
    13 years 5 months ago
    Polynomial-Time Computable Backup Tables for Shortest-Path Routing
    Download  www.lab2.kuis.kyoto-u.ac.jp
    For networks employing shortest-path routing, we introduce a new recovery scheme which needs only one backup routing table. By precomputing this backup table, the network recovers...
    Hiro Ito, Kazuo Iwama, Yasuo Okabe, Takuya Yoshihi...
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.