Set-to-Set Disjoint Path Routing in Bijective Connection Graphs-Reference-Cited by-同舟云学术

Set-to-Set Disjoint Path Routing in Bijective Connection Graphs

Author:

Kaneko Keiichi¹^ORCID,Bossard Antoine²^ORCID,Harris Frederick C.³^ORCID

Affiliation:

1. Institute of Engineering, Tokyo University of Agriculture and Technology, Tokyo, Japan

2. Graduate School of Science, Kanagawa University, Hiratsuka, Japan

3. Department of Computer Science and Engineering, University of Nevada, Reno, Reno, NV, USA

Funder

Grant-in-Aid for Scientific Research (C) of the Japan Society for the Promotion of Science

Publisher

Institute of Electrical and Electronics Engineers (IEEE)

Subject

General Engineering,General Materials Science,General Computer Science,Electrical and Electronic Engineering

Link

Reference59 articles.

1. An algorithm for node-to-set disjoint paths problem in burnt pancake graphs;kaneko;IEICE Trans Inf Syst,2003

2. An algorithm for node-to-set disjoint paths problem in rotator graphs;kaneko;IEICE Trans Inf Syst,2001

3. An algorithm for node-disjoint paths in pancake graphs;suzuki;IEICE Trans Inf Syst,2003

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

2. Path covers of bubble-sort star graphs;The Journal of Supercomputing;2023-04-12