Sciweavers

    STOC
    1992
    ACM
    122views Algorithms» more  STOC 1992»
    Existence and Construction of Edge Disjoint Paths on Expander Graphs
    13 years 8 months ago
    Existence and Construction of Edge Disjoint Paths on Expander Graphs
    Download  www.math.cmu.edu
    Given an expander graph G = (V, E) and a set of q disjoint pairs of vertices in V , we are interested in finding for each pair (ai, bi), a path connecting ai to bi, such that the ...
    Andrei Z. Broder, Alan M. Frieze, Eli Upfal
    claim paper
    Read More »
    SRDS
    2005
    IEEE
    92views Operating System» more  SRDS 2005»
    Distributed Construction of a Fault-Tolerant Network from a Tree
    13 years 10 months ago
    Distributed Construction of a Fault-Tolerant Network from a Tree
    Download  www.cs.unc.edu
    We present an algorithm by which nodes arranged in a tree, with each node initially knowing only its parent and children, can construct a fault-tolerant communication structure (a...
    Michael K. Reiter, Asad Samar, Chenxi Wang
    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.