Sciweavers

    2 search results - page 1 / 1
    » Fast Estimation of Diameter and Shortest Paths (without Matr...
    Sort
    View
    SODA
    1996
    ACM
    138views Algorithms» more  SODA 1996»
    Fast Estimation of Diameter and Shortest Paths (without Matrix Multiplication)
    13 years 6 months ago
    Fast Estimation of Diameter and Shortest Paths (without Matrix Multiplication)
    Download  reports.stanford.edu
    Donald Aingworth, Chandra Chekuri, Rajeev Motwani
    claim paper
    Read More »
    WADS
    2007
    Springer
    104views Algorithms» more  WADS 2007»
    Faster Approximation of Distances in Graphs
    13 years 11 months ago
    Faster Approximation of Distances in Graphs
    Download  www.cse.psu.edu
    Let G = (V, E) be an weighted undirected graph on n vertices and m edges, and let dG be its shortest path metric. We present two simple deterministic algorithms for approximating ...
    Piotr Berman, Shiva Prasad Kasiviswanathan
    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.