Sciweavers

    2 search results - page 1 / 1
    » Fast Algorithms for Maintaining Shortest Paths in Outerplana...
    Sort
    View
    FCT
    1995
    Springer
    123views Applied Computing» more  FCT 1995»
    Fast Algorithms for Maintaining Shortest Paths in Outerplanar and Planar Digraphs
    13 years 8 months ago
    Fast Algorithms for Maintaining Shortest Paths in Outerplanar and Planar Digraphs
    Download  www.ceid.upatras.gr
    Abstract. We present algorithms for maintaining shortest path information in dynamic outerplanar digraphs with sublogarithmic query time. By choosing appropriate parameters we achi...
    Hristo Djidjev, Grammati E. Pantziou, Christos D. ...
    claim paper
    Read More »
    OPODIS
    2008
    71views Distributed And Parallel Com...» more  OPODIS 2008»
    Fast Geometric Routing with Concurrent Face Traversal
    13 years 5 months ago
    Fast Geometric Routing with Concurrent Face Traversal
    Download  deneb.cs.kent.edu
    We present a concurrent face routing CFR algorithm. We formally prove that the worst case latency of our algorithm is asymptotically optimal. Our simulation results demonstrate tha...
    Thomas Clouser, Mark Miyashita, Mikhail Nesterenko
    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.