Sciweavers

    171 search results - page 3 / 35
    » Algorithms for Single-Source Vertex Connectivity
    Sort
    View
    FOCS
    2009
    IEEE
    109views Theoretical Computer Science» more  FOCS 2009»
    An O(k^3 log n)-Approximation Algorithm for Vertex-Connectivity Survivable Network Design
    14 years 2 months ago
    An O(k^3 log n)-Approximation Algorithm for Vertex-Connectivity Survivable Network Design
    Download  www.cis.upenn.edu
    Julia Chuzhoy, Sanjeev Khanna
    claim paper
    Read More »
    JCSS
    2006
    40views more  JCSS 2006»
    Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems
    13 years 10 months ago
    Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems
    Download  www.cs.dartmouth.edu
    Lisa Fleischer, Kamal Jain, David P. Williamson
    claim paper
    Read More »
    ISAAC
    1998
    Springer
    71views Algorithms» more  ISAAC 1998»
    K-Edge and 3-Vertex Connectivity Augmentation in an Arbitrary Multigraph
    14 years 3 months ago
    K-Edge and 3-Vertex Connectivity Augmentation in an Arbitrary Multigraph
    Download  www.orsj.or.jp
    Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibar...
    claim paper
    Read More »
    SODA
    2008
    ACM
    127views Algorithms» more  SODA 2008»
    Nondecreasing paths in a weighted graph or: how to optimally read a train schedule
    14 years 8 days ago
    Nondecreasing paths in a weighted graph or: how to optimally read a train schedule
    Download  www.cs.cmu.edu
    A travel booking office has timetables giving arrival and departure times for all scheduled trains, including their origins and destinations. A customer presents a starting city a...
    Virginia Vassilevska
    claim paper
    Read More »
    EDBT
    2012
    ACM
    228views Database» more  EDBT 2012»
    Finding maximal k-edge-connected subgraphs from a large graph
    12 years 1 months ago
    Finding maximal k-edge-connected subgraphs from a large graph
    Download  www.edbt.org
    In this paper, we study how to find maximal k-edge-connected subgraphs from a large graph. k-edge-connected subgraphs can be used to capture closely related vertices, and findin...
    Rui Zhou, Chengfei Liu, Jeffrey Xu Yu, Weifa Liang...
    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.