Search Sciweavers | Sciweavers

3 search results - page 1 / 1

» Many-to-many Disjoint Path Covers in a Graph with Faulty Ele...

click to vote

COCOON
2004
Springer

62views Combinatorics» more COCOON 2004»

One-to-Many Disjoint Path Covers in a Graph with Faulty Elements

13 years 9 months ago

Download tcs.cuk.ac.kr

Jung-Heum Park

claim paper

Read More »

click to vote

ISAAC
2004
Springer

96views Algorithms» more ISAAC 2004»

Many-to-many Disjoint Path Covers in a Graph with Faulty Elements

13 years 9 months ago

Download tcs.cuk.ac.kr

Jung-Heum Park, Hee-Chul Kim, Hyeong-Seok Lim

claim paper

Read More »

click to vote

ISCAPDCS
2007

117views Distributed And Parallel Com...» more ISCAPDCS 2007»

A Node-to-set cluster-fault-tolerant disjoint routing algorithm in pancake graphs

13 years 5 months ago

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 »

« Prev « First page 1 / 1 Last » Next »

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers