Sciweavers

    243 search results - page 2 / 49
    » On the Exponent of the All Pairs Shortest Path Problem
    Sort
    View
    STOC
    2003
    ACM
    126views Algorithms» more  STOC 2003»
    A new approach to dynamic all pairs shortest paths
    14 years 5 months ago
    A new approach to dynamic all pairs shortest paths
    Download  www.dis.uniroma1.it
    We study novel combinatorial properties of graphs that allow us to devise a completely new approach to dynamic all pairs shortest paths problems. Our approach yields a fully dynam...
    Camil Demetrescu, Giuseppe F. Italiano
    claim paper
    Read More »
    SIAMCOMP
    2010
    172views more  SIAMCOMP 2010»
    More Algorithms for All-Pairs Shortest Paths in Weighted Graphs
    12 years 12 months ago
    More Algorithms for All-Pairs Shortest Paths in Weighted Graphs
    Download  www.cs.uwaterloo.ca
    In the first part of the paper, we reexamine the all-pairs shortest paths (APSP) problem and present a new algorithm with running time O(n3 log3 log n/ log2 n), which improves all...
    Timothy M. Chan
    claim paper
    Read More »
    FCCM
    2006
    IEEE
    107views VLSI» more  FCCM 2006»
    Hardware/Software Integration for FPGA-based All-Pairs Shortest-Paths
    13 years 11 months ago
    Hardware/Software Integration for FPGA-based All-Pairs Shortest-Paths
    Download  www.cse.ohio-state.edu
    Field-Programmable Gate Arrays (FPGAs) are being employed in high performance computing systems owing to their potential to accelerate a wide variety of long-running routines. Par...
    Uday Bondhugula, Ananth Devulapalli, James Dinan, ...
    claim paper
    Read More »
    CPM
    2008
    Springer
    149views Combinatorics» more  CPM 2008»
    On Compact Representations of All-Pairs-Shortest-Path-Distance Matrices
    13 years 7 months ago
    On Compact Representations of All-Pairs-Shortest-Path-Distance Matrices
    Download  hpc.isti.cnr.it
    Let G be an unweighted and undirected graph of n nodes, and let D be the n
    Igor Nitto, Rossano Venturini
    claim paper
    Read More »
    STACS
    2005
    Springer
    110views Theoretical Computer Science» more  STACS 2005»
    All-Pairs Nearly 2-Approximate Shortest-Paths in O(n2 polylog n) Time
    13 years 10 months ago
    All-Pairs Nearly 2-Approximate Shortest-Paths in O(n2 polylog n) Time
    Download  www.cse.iitd.ernet.in
    Surender Baswana, Vishrut Goyal, Sandeep Sen
    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.