Unpaired many-to-many disjoint path cover of balanced hypercubes

12/10/2019
by   Huazhong Lü, et al.
0

The balanced hypercube BH_n, which is a variant of the hypercube, was proposed as a desired interconnection network topology. It is known that BH_n is bipartite. Assume that S={s_1,s_2,...,s_2n-2} and T={t_1,t_2,...,t_2n-2} are any two sets of vertices in different partite sets of BH_n (n≥2). It has been proved that there exists paired 2-disjoint path cover of BH_n. In this paper, we prove that there exists (2n-2)-disjoint path cover of BH_n (n≥2) from S to T, which partially improved some known results. The upper bound 2n-2 of the number of disjoint paths in unpaired (2n-2)-disjoint path cover is optimal.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/08/2022

Directed Steiner path packing and directed path connectivity

For a digraph D=(V(D), A(D)), and a set S⊆ V(D) with r∈ S and |S|≥ 2, a ...
research
10/21/2022

Rerouting Planar Curves and Disjoint Paths

In this paper, we consider a transformation of k disjoint paths in a gra...
research
12/22/2020

Computing Directed Steiner Path Covers

In this article we consider the Directed Steiner Path Cover problem on d...
research
03/23/2023

Perturbation-Resilient Sets for Dynamic Service Balancing

Balanced and swap-robust minimal trades, introduced in [1], are importan...
research
03/07/2018

Approximation algorithms for two-machine flow-shop scheduling with a conflict graph

Path cover is a well-known intractable problem that finds a minimum numb...
research
02/13/2023

General Position Problem of Butterfly Networks

A general position set S is a set S of vertices in G(V,E) such that no t...
research
06/25/2020

Lifted Disjoint Paths with Application in Multiple Object Tracking

We present an extension to the disjoint paths problem in which additiona...

Please sign up or login with your details

Forgot password? Click here to reset