Sciweavers

    SIAMCOMP
    2010
    120views more  SIAMCOMP 2010»
    Edge Disjoint Paths in Moderately Connected Graphs
    13 years 10 months ago
    Edge Disjoint Paths in Moderately Connected Graphs
    Download  www.cs.cmu.edu
    Abstract. We study the Edge Disjoint Paths (EDP) problem in undirected graphs: Given a graph G with n nodes and a set T of pairs of terminals, connect as many terminal pairs as pos...
    Satish Rao, Shuheng Zhou
    claim paper
    Read More »
    SPAA
    2003
    ACM
    104views Distributed And Parallel Com...» more  SPAA 2003»
    Short length menger's theorem and reliable optical routing
    14 years 4 months ago
    Short length menger's theorem and reliable optical routing
    Download  www.nd.edu
    In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...
    Amitabha Bagchi, Amitabh Chaudhary, Petr Kolman
    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.