Sciweavers

    3 search results - page 1 / 1
    » One-to-Many Disjoint Path Covers in a Graph with Faulty Elem...
    Sort
    View
    COCOON
    2004
    Springer
    62views Combinatorics» more  COCOON 2004»
    One-to-Many Disjoint Path Covers in a Graph with Faulty Elements
    15 years 8 months ago
    One-to-Many Disjoint Path Covers in a Graph with Faulty Elements
    Download  tcs.cuk.ac.kr
    Jung-Heum Park
    claim paper
    Read More »
    ISAAC
    2004
    Springer
    96views Algorithms» more  ISAAC 2004»
    Many-to-many Disjoint Path Covers in a Graph with Faulty Elements
    15 years 8 months ago
    Many-to-many Disjoint Path Covers in a Graph with Faulty Elements
    Download  tcs.cuk.ac.kr
    Jung-Heum Park, Hee-Chul Kim, Hyeong-Seok Lim
    claim paper
    Read More »
    ISCAPDCS
    2007
    117views Distributed And Parallel Com...» more  ISCAPDCS 2007»
    A Node-to-set cluster-fault-tolerant disjoint routing algorithm in pancake graphs
    15 years 4 months ago
    A Node-to-set cluster-fault-tolerant disjoint routing algorithm in pancake graphs
    Download  cis.k.hosei.ac.jp
    With rapid increase of parallel computation systems in their sizes, it is inevitable to develop algorithms that are applicable even if there exist faulty elements in the systems. ...
    Tatsuro Watanabe, Keiichi Kaneko, Shietung Peng
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    i2PDF i2Img i2Text i2OCR i2Symbol i2Type i2Speak i2Style i2Arabic i2Bopomo Latex Equation Editor
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2026, USA.