𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An Improved Algorithm for the Half-Disjoint Paths Problem

✍ Scribed by Kawarabayashi, Ken-ichi; Kobayashi, Yusuke

Book ID
118197908
Publisher
Society for Industrial and Applied Mathematics
Year
2011
Tongue
English
Weight
173 KB
Volume
25
Category
Article
ISSN
0895-4801

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An Efficient Algorithm for the k-Pairwis
An Efficient Algorithm for the k-Pairwise Disjoint Paths Problem in Hypercubes
✍ Qian-Ping Gu; Shietung Peng πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 140 KB

A graph G(V, E) (|V| 2k) satisfies property A k if, given k pairs of distinct nodes (s 1 , t 1 ), ..., (s k , t k ) of V(G), there are k mutually node-disjoint paths, one connecting s i and t i for each i, 1 i k. A necessary condition for any graph to satisfy A k is that it is (2k&1)-connected. Hype

An algorithm for disjoint paths in bubbl
An algorithm for disjoint paths in bubble-sort graphs
✍ Yasuto Suzuki; Keiichi Kaneko πŸ“‚ Article πŸ“… 2006 πŸ› John Wiley and Sons 🌐 English βš– 518 KB

## Abstract An __n__‐dimensional bubble‐sort graph is regular and symmetric. It has __n__! nodes and (__n__βˆ’1)__n__!/2 edges while its connectivity and diameter are __n__βˆ’1 and __n__(__n__βˆ’1)/2, respectively. Bubble‐sort graphs are attracting attention because of their simple, symmetric, and recurs