Abstract: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, S = {s 1 , . . . , s k } and T = {t 1 , . . . , t k }, in graph G, an unpaired many-to-many k-disjoint path cover joining S and T is a disjoint path cover {P 1 , . . . , P k }, in which each path P i runs from source s i to… Show more
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.