Related references
Note: Only part of the references are listed.Node-Disjoint Paths Problems in Directed Bijective Connection Graphs
Keiichi Kaneko
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS (2020)
Pairwise Disjoint Paths Routing in Tori
Keiichi Kaneko et al.
IEEE ACCESS (2020)
Fault diagnosability of DQcube under the PMC model
Mengjie Lv et al.
DISCRETE APPLIED MATHEMATICS (2019)
Reliability Analysis of the Bijective Connection Networks for Components
Litao Guo et al.
MATHEMATICS (2019)
Node-to-node Disjoint Paths in Twisted Crossed Cubes
Hiroki Nagashima et al.
PROCEEDINGS OF THE 10TH INTERNATIONAL CONFERENCE ON ADVANCES IN INFORMATION TECHNOLOGY (IAIT2018) (2018)
Node-to-Node Disjoint Paths Problem in Mobius Cubes
David Kocik et al.
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS (2017)
Fault-tolerant routing methodology for hypercube and cube-connected cycles interconnection networks
Hossein Habibian et al.
JOURNAL OF SUPERCOMPUTING (2017)
Node-to-Node Disjoint Paths Problem in Mobius Cubes
David Kocik et al.
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS (2017)
Many-to-many disjoint paths in hypercubes with faulty vertices
Xiang Jun Li et al.
DISCRETE APPLIED MATHEMATICS (2017)
The twisted crossed cube
Xinyang Wang et al.
CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE (2016)
Node-to-Set Disjoint Paths Problem in a Mobius Cube
David Kocik et al.
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS (2016)
On conditional fault tolerance and diagnosability of hierarchical cubic networks
Shuming Zhou et al.
THEORETICAL COMPUTER SCIENCE (2016)
Node-to-Set Disjoint Paths Problem in a Mobius Cube
David Kocik et al.
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS (2016)
Embedding of the Folded Hypercubes into Tori
Jasintha Quadras et al.
MATHEMATICS IN COMPUTER SCIENCE (2015)
Set-to-Set Disjoint Paths Routing in Hierarchical Cubic Networks
Antoine Bossard et al.
COMPUTER JOURNAL (2014)
Reliability analysis of bijective connection networks in terms of the extra edge-connectivity
Mingzu Zhang et al.
INFORMATION SCIENCES (2014)
An efficient construction of one-to-many node-disjoint paths in folded hypercubes
Cheng-Nan Lai
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING (2014)
DVcube: A novel compound architecture of disc-ring graph and hypercube-like graph
Ruo-Wei Hung
THEORETICAL COMPUTER SCIENCE (2013)
The Set-to-Set Disjoint-Path Problem in Perfect Hierarchical Hypercubes
Antoine Bossard et al.
COMPUTER JOURNAL (2012)
One-to-many node-disjoint paths of hyper-star networks
Laszlo Liptak et al.
DISCRETE APPLIED MATHEMATICS (2012)
The spined cube: A new hypercube variant with smaller diameter
Wujun Zhou et al.
INFORMATION PROCESSING LETTERS (2011)
DISJOINT-PATHS AND FAULT-TOLERANT ROUTING ON RECURSIVE DUAL-NET
Yamin Li et al.
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE (2011)
An efficient fault-tolerant routing algorithm in bijective connection networks with restricted faulty edges
Jianxi Fan et al.
THEORETICAL COMPUTER SCIENCE (2011)
One-to-one disjoint path covers on k-ary n-cubes
Yuan-Kang Shih et al.
THEORETICAL COMPUTER SCIENCE (2011)
One-to-many node-disjoint paths in (n, k)-star graphs
Yonghong Xiang et al.
DISCRETE APPLIED MATHEMATICS (2010)
Many-to-many disjoint paths in faulty hypercubes
Xie-Bin Chen
INFORMATION SCIENCES (2009)
The container problem in bubble-sort graph
Yasuto Suzuki et al.
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS (2008)
Constructing vertex-disjoint paths in (n,k)-star graphs
Tsung-Chi Lin et al.
INFORMATION SCIENCES (2008)
Edge-pancyclicity and path-embeddability of bijective connection graphs
Jianxi Fan et al.
INFORMATION SCIENCES (2008)
Node-disjoint paths in hierarchical hypercube networks
Ruei-Yu Wu et al.
INFORMATION SCIENCES (2007)
An algorithm for node-to-node disjoint paths problem in burnt pancake graphs
Keiichi Kaneko et al.
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS (2007)
The locally twisted cubes
XF Yang et al.
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS (2005)
Node-disjoint paths and related problems on hierarchical cubic networks
JS Fu et al.
NETWORKS (2002)
Share Paper
