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="Wang, Shiying"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Strong matching preclusion for torus networks
Shiying Wang
,
Kai Feng
Theoretical Computer Science
520
, 2014, pp. 97-110
Fault tolerance in the arrangement graphs
Shiying Wang
,
Kai Feng
Theoretical Computer Science
533
, 2014, pp. 64-71
Sufficient conditions for
k
-restricted edge connected graphs
Shiying Wang
,
Lei Zhang
Theoretical Computer Science
557
, 2014, pp. 66-75
Fault-tolerant embedding of cycles of various lengths in
k
-ary
n
-cubes
Shiying Wang
,
Jing Li
,
Shangwei Lin
,
Ruixia Wang
Information and Computation
230
, 2013, pp. 55-66
Fault-free Hamiltonian cycles passing through a linear forest in ternary
n
-cubes with faulty edges
Yuxing Yang
,
Shiying Wang
Theoretical Computer Science
491
, 2013, pp. 78-82
Many-to-many disjoint path covers in
k
-ary
n
-cubes
Shurong Zhang
,
Shiying Wang
Theoretical Computer Science
491
, 2013, pp. 103-118
Fault tolerance in bubble-sort graph networks
Shiying Wang
,
Yuxing Yang
Theoretical Computer Science
421
, 2012, pp. 62-69
Fault tolerance in
k
-ary
n
-cube networks
Shiying Wang
,
Guozhen Zhang
,
Kai Feng
Theoretical Computer Science
460
, 2012, pp. 34-41
A neighborhood condition for graphs to be maximally
k
-restricted edge connected
Shiying Wang
,
Lei Zhang
,
Shangwei Lin
Information Processing Letters
112
(3), 2012, pp. 95-97
Pancyclicity of ternary
n
-cube networks under the conditional fault model
Jing Li
,
Shiying Wang
,
Di Liu
Information Processing Letters
111
(8), 2011, pp. 370-374
Embedding Hamiltonian paths in
k
-ary
n
-cubes with conditional edge faults
Shiying Wang
,
Shurong Zhang
Theoretical Computer Science
412
(46), 2011, pp. 6570-6584
Neighborhood conditions for graphs to be super restricted edge connected
Shiying Wang
,
Jing Li
,
Lihong Wu
,
Shangwei Lin
Networks
56
(1), 2010, pp. 11-19
Kings in locally semicomplete digraphs
Ruixia Wang
,
Aimin Yang
,
Shiying Wang
Journal of Graph Theory
63
(4), 2010, pp. 279-287
\lambda'
-optimal digraphs
Shiying Wang
,
Shangwei Lin
Information Processing Letters
108
(6), 2008, pp. 386-389
Sufficient conditions for a graph to be super restricted edge-connected
Shiying Wang
,
Shangwei Lin
Networks
51
(3), 2008, pp. 200-209
Sufficient conditions for super-arc-strongly connected oriented graphs
Shiying Wang
,
Jun Yuan
,
Aixia Liu
Graphs and Combinatorics
24
(6), 2008, pp. 587-595