Constructing vertex-disjoint paths in (n, k)-star graphs

13 years 3 months ago

Download par.cse.nsysu.edu.tw

This work develops a novel general routing algorithm, which is a routing function, for constructing a container of width n1 between any pair of vertices in an (n, k)-star graph with

Tsung-Chi Lin, Dyi-Rong Duh

Real-time Traffic

Algorithm | General | ISCI 2006 | ISCI 2008 | Routing |

claim paper

» Shortest VertexDisjoint TwoFace Paths in Planar Graphs

» Testing 2Vertex Connectivity and Computing Pairs of VertexDisjoint st Paths in Digraphs

» Vertex disjoint routings of cycles over tori

» Parameterized Approximability of the Disjoint Cycle Problem

» Unconditionally reliable message transmission in directed networks

» Labeling Schemes for Vertex Connectivity

» Finding Disjoint Paths in Expanders Deterministically and Online

» Counting Subgraphs via Homomorphisms

Post Info
More Details (n/a)

Added	27 Dec 2010
Updated	27 Dec 2010
Type	Journal
Year	2008
Where	ISCI
Authors	Tsung-Chi Lin, Dyi-Rong Duh

Comments (0)

Sciweavers

Constructing vertex-disjoint paths in (n, k)-star graphs

Algorithm | General | ISCI 2006 | ISCI 2008 | Routing |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers