Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Lai, Cheng-Nan"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the construction of all shortest vertex-disjoint paths in Cayley graphs of Abelian groups
Cheng-Nan Lai
Theoretical Computer Science
571
, 2015, pp. 10-20
An efficient construction of one-to-many node-disjoint paths in folded hypercubes
Cheng-Nan Lai
Journal Parallel Distributed Computing
74
(4), 2014, pp. 2310-2316
Two spanning disjoint paths with required length in generalized hypercubes
Dyi-Rong Duh
,
Yao-Chung Lin
,
Cheng-Nan Lai
,
Yue-Li Wang
Theoretical Computer Science
506
, 2013, pp. 55-78
Two conditions for reducing the maximal length of node-disjoint paths in hypercubes
Cheng-Nan Lai
Theoretical Computer Science
418
, 2012, pp. 82-91
w
-Rabin numbers and strong
w
-Rabin numbers of folded hypercubes
Cheng-Nan Lai
,
Gen-Huey Chen
Networks
51
(3), 2008, pp. 171-177
Strong Rabin numbers of folded hypercubes
Cheng-Nan Lai
,
Gen-Huey Chen
Theoretical Computer Science
341
(1-3), 2005, pp. 196-215