Sciweavers

    2 search results - page 1 / 1
    » NP-Completeness Results for Minimum Planar Spanners
    Sort
    View
    53
    Voted
    DMTCS
    1998
    103views Mathematics» more  DMTCS 1998»
    NP-Completeness Results for Minimum Planar Spanners
    14 years 9 months ago
    NP-Completeness Results for Minimum Planar Spanners
    Download  www.inf.uni-konstanz.de
    Ulrik Brandes, Dagmar Handke
    claim paper
    Read More »
    SIROCCO
    2001
    148views Information Technology» more  SIROCCO 2001»
    Competitive Online Routing in Geometric Graphs
    14 years 11 months ago
    Competitive Online Routing in Geometric Graphs
    Download  cg.scs.carleton.ca
    We consider online routing algorithms for finding paths between the vertices of plane graphs. Although it has been shown in Bose et al. [4] that there exists no competitive routin...
    Prosenjit Bose, Pat Morin
    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-2025, USA.