AbstractA k-disjoint path cover of a graph is defined as a set of k internally vertex-disjoint paths connecting given sources and sinks in such a way that every vertex of the graph is covered by a path in the set. In this paper, we analyze the k-disjoint path cover of recursive circulant G(2m,4) under the condition that at most f faulty vertices and/or edges are removed. It is shown that when m≥3, G(2m,4) has a k-disjoint path cover (of one-to-one type) joining any pair of two distinct source and sink for arbitrary f and k≥2 subject to f+k≤m. In addition, it is proven that when m≥5, G(2m,4) has a k-disjoint path cover (of unpaired many-to-many type) joining any two disjoint sets of k sources and k sinks for arbitrary f and k≥2 satisfying f+...
The Disjoint Paths Problem asks, given a graph G and a set of pairs of terminals (s1, t1),..., (sk, ...
A path partition or a path cover of a graph G is a collection P of paths in G such that every edge o...
The Disjoint Paths Problem asks, given a graph G and a set of pairs of terminals (s1, t1),..., (sk, ...
AbstractA k-disjoint path cover of a graph is defined as a set of k internally vertex-disjoint paths...
Abstract. In a graph G, k vertex disjoint paths joining k distinct sourcesink pairs that cover all t...
A Disjoint Path Cover (DPC for short) of a graph is a set of pairwise (inter-nally) disjoint paths t...
One of the key problems in parallel processing is finding disjoint paths in the underlying graph of ...
AbstractIn this paper, we investigate a problem on embedding paths into recursive circulant G(2m,4) ...
In this paper, we investigate a problem on embedding paths into recursive circulant G(2 m, 4) with f...
A paired many-to-many k-disjoint path cover (k-DPC for short) of a graph is a set of k disjoint path...
AbstractThe k-ary n-cube, Qnk, is one of the most popular interconnection networks. Let n≥2 and k≥3....
The Disjoint Paths Problem asks, given a graph G and a set of pairs of terminals (s1,t1),…,(sk,tk)(s...
[[abstract]]Embedding of paths have attracted much attention in the parallel processing. Many-to-man...
Paths in a graph are mutually induced if any two distinct and have neither common vertices nor a...
AbstractA subset S of vertices of a graph G is called a k-path vertex cover if every path of order k...
The Disjoint Paths Problem asks, given a graph G and a set of pairs of terminals (s1, t1),..., (sk, ...
A path partition or a path cover of a graph G is a collection P of paths in G such that every edge o...
The Disjoint Paths Problem asks, given a graph G and a set of pairs of terminals (s1, t1),..., (sk, ...
AbstractA k-disjoint path cover of a graph is defined as a set of k internally vertex-disjoint paths...
Abstract. In a graph G, k vertex disjoint paths joining k distinct sourcesink pairs that cover all t...
A Disjoint Path Cover (DPC for short) of a graph is a set of pairwise (inter-nally) disjoint paths t...
One of the key problems in parallel processing is finding disjoint paths in the underlying graph of ...
AbstractIn this paper, we investigate a problem on embedding paths into recursive circulant G(2m,4) ...
In this paper, we investigate a problem on embedding paths into recursive circulant G(2 m, 4) with f...
A paired many-to-many k-disjoint path cover (k-DPC for short) of a graph is a set of k disjoint path...
AbstractThe k-ary n-cube, Qnk, is one of the most popular interconnection networks. Let n≥2 and k≥3....
The Disjoint Paths Problem asks, given a graph G and a set of pairs of terminals (s1,t1),…,(sk,tk)(s...
[[abstract]]Embedding of paths have attracted much attention in the parallel processing. Many-to-man...
Paths in a graph are mutually induced if any two distinct and have neither common vertices nor a...
AbstractA subset S of vertices of a graph G is called a k-path vertex cover if every path of order k...
The Disjoint Paths Problem asks, given a graph G and a set of pairs of terminals (s1, t1),..., (sk, ...
A path partition or a path cover of a graph G is a collection P of paths in G such that every edge o...
The Disjoint Paths Problem asks, given a graph G and a set of pairs of terminals (s1, t1),..., (sk, ...