相关参考文献
注意：仅列出部分参考文献，下载原文获取全部文献信息。One-to-one disjoint path covers in digraphs
Huabin Cao et al.
THEORETICAL COMPUTER SCIENCE (2018)
Paired 2-disjoint path covers of multi-dimensional torus networks with 2n-3 faulty edges
Jing Li et al.
THEORETICAL COMPUTER SCIENCE (2017)
Generalized Gray codes with prescribed ends
Tomas Dvorak et al.
THEORETICAL COMPUTER SCIENCE (2017)
Paired many-to-many disjoint path covers of hypertori
Brian G. Kronenthal et al.
DISCRETE APPLIED MATHEMATICS (2017)
Algorithms for finding disjoint path covers in unit interval graphs
Jung-Heum Park et al.
DISCRETE APPLIED MATHEMATICS (2016)
Ore-type degree conditions for disjoint path covers in simple graphs
Hyeong-Seok Lim et al.
DISCRETE MATHEMATICS (2016)
Paired 2-disjoint path covers of multidimensional torus networks with faulty edges
Xie-Bin Chen
INFORMATION PROCESSING LETTERS (2016)
Paired 2-disjoint path covers of faulty k-ary n-cubes
Xie-Bin Chen
THEORETICAL COMPUTER SCIENCE (2016)
An efficient algorithm to construct disjoint path covers of DCell networks
Xi Wang et al.
THEORETICAL COMPUTER SCIENCE (2016)
Many-to-many two-disjoint path covers in cylindrical and toroidal grids
Jung-Heum Park et al.
DISCRETE APPLIED MATHEMATICS (2015)
Sampling automata and programs
Qin Li et al.
THEORETICAL COMPUTER SCIENCE (2015)
One-to-one disjoint path covers on multi-dimensional tori
Jing Li et al.
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS (2015)
Many-to-many disjoint path covers in k-ary n-cubes
Shurong Zhang et al.
THEORETICAL COMPUTER SCIENCE (2013)
Paired many-to-many disjoint path covers in faulty hypercubes
Shinhaeng Jo et al.
THEORETICAL COMPUTER SCIENCE (2013)
One-to-one disjoint path covers on k-ary n-cubes
Yuan-Kang Shih et al.
THEORETICAL COMPUTER SCIENCE (2011)
The 1-Fixed-Endpoint Path Cover Problem is Polynomial on Interval Graphs
Katerina Asdre et al.
ALGORITHMICA (2010)
Many-to-Many Disjoint Path Covers in the Presence of Faulty Elements
Jung-Heum Park et al.
IEEE TRANSACTIONS ON COMPUTERS (2009)
PARTITIONS OF FAULTY HYPERCUBES INTO PATHS WITH PRESCRIBED ENDVERTICES
Tomas Dvorak et al.
SIAM JOURNAL ON DISCRETE MATHEMATICS (2008)
Hamiltonian path embedding and pancyclicity on the Mobius cube with faulty nodes and faulty edges
Sun-Yuan Hsieh et al.
IEEE TRANSACTIONS ON COMPUTERS (2006)
Many-to-many disjoint path covers in hypercube-like interconnection networks with faulty elements
JH Park et al.
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS (2006)
Longest fault-free paths in star graphs with vertex faults
SY Hsieh et al.
THEORETICAL COMPUTER SCIENCE (2001)
分享论文
