Unpaired Many-to-Many Disjoint Path Covers in Nonbipartite Torus-Like Graphs With Faulty Elements

Unpaired Many-to-Many Disjoint Path Covers in Nonbipartite Torus-Like Graphs With Faulty Elements

One of the key problems in parallel processing is finding disjoint paths in the underlying graph of an interconnection network. The disjoint path cover of a graph is a set of pairwise vertex-disjoint paths that altogether cover every vertex of the graph. Given disjoint source and sink sets, <inli...

Full description

Bibliographic Details
Main Author: Jung-Heum Park
Format: Article
Language:English
Published: IEEE 2022-01-01
Series:IEEE Access
Subjects:
Disjoint path
path cover
path partition
torus
toroidal grid
interconnection network
Online Access:https://ieeexplore.ieee.org/document/9970333/

Internet

https://ieeexplore.ieee.org/document/9970333/

Similar Items