Zobrazeno 1 - 10
of 20
pro vyhledávání: '"Sheng-Chyang Liaw"'
Publikováno v:
Discrete Applied Mathematics. 337:232-245
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fc5a3ab0468d50f936d4b162a7299263
https://doi.org/10.1016/j.dam.2023.05.005
https://doi.org/10.1016/j.dam.2023.05.005
Publikováno v:
Discrete Applied Mathematics. 313:135-146
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f5c4ae8d94ce7379541309f0ed56dbd3
https://doi.org/10.1016/j.dam.2022.02.004
https://doi.org/10.1016/j.dam.2022.02.004
Publikováno v:
Discrete Applied Mathematics. 291:264-270
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ad2fa4e43f33f88289042950af1b1970
https://doi.org/10.1016/j.dam.2020.12.019
https://doi.org/10.1016/j.dam.2020.12.019
Publikováno v:
Theoretical Computer Science. 609:262-271
All-to-all communication occurs in many important applications in parallel processing. In this paper, we study the all-to-all broadcast number (the shortest time needed to complete the all-to-all broadcast) of Cartesian product of graphs under the as
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cafe1e1900cd173e24fe6da04c1138e9
https://doi.org/10.1016/j.tcs.2015.10.002
https://doi.org/10.1016/j.tcs.2015.10.002
Publikováno v:
Discrete Mathematics. 338:248-255
Given a graph G and a function h from E ( G ) to N , the h -subdivision of G , denoted by G ( h ) , is the graph obtained from G by replacing each edge u v in G with a path P : u x u v 1 x u v 2 ? x u v n - 1 v , where n = h ( u v ) . When h ( e ) =
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::54af287653702689ceaf3ccbe7f49ba6
https://doi.org/10.1016/j.disc.2014.09.006
https://doi.org/10.1016/j.disc.2014.09.006
Publikováno v:
Journal of Combinatorial Optimization. 28:400-413
Given a graph $$G$$ and a set $$S\subseteq V(G),$$ a vertex $$v$$ is said to be $$F_{3}$$ -dominated by a vertex $$w$$ in $$S$$ if either $$v=w,$$ or $$v\notin S$$ and there exists a vertex $$u$$ in $$V(G)-S$$ such that $$P:wuv$$ is a path in $$G$$ .
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d6ee010dfb1ec31cf8bbce3efe3cbbd4
https://doi.org/10.1007/s10878-012-9563-y
https://doi.org/10.1007/s10878-012-9563-y
Publikováno v:
Discrete Mathematics. 312:3037-3045
Let G be a graph and let k be a positive integer. Consider the following two-person game which is played on G : Alice and Bob alternate turns. A move consists of selecting an unlabeled vertex v of G and assigning it a number a from { 0 , 1 , 2 , …
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::51b25faa8c7fca2cc7ce48c44b5fe0c5
https://doi.org/10.1016/j.disc.2012.07.002
https://doi.org/10.1016/j.disc.2012.07.002
Publikováno v:
Discrete Mathematics. 263:191-206
For each integer n ≥ 5 and each rational number r in the interval [2, n - 1], we construct a Kn-minor free graph G with χc(G) = r. This answers a question asked by Zhu (Discrete Mathematics, 229 (1-3) (2001) 371). In case n = 5, the constructed gr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::17fe96453fd417a7bbe9f2a0a12c523e
https://doi.org/10.1016/s0012-365x(02)00529-0
https://doi.org/10.1016/s0012-365x(02)00529-0
Autor:
Sheng-Chyang Liaw, Frank K. Hwang
Publikováno v:
IEEE/ACM Transactions on Networking. 8:535-539
We give necessary and sufficient conditions for strictly nonblocking three-stage Clos (1953) networks with two types of multicast traffic. Then, we extend the results to other models where the routing is under certain restrictions. Finally, we compar
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7c9f4ec01f5494e39e55c68fd1652b34
https://doi.org/10.1109/90.865081
https://doi.org/10.1109/90.865081
Publikováno v:
Annals of Combinatorics. 2:165-172
Reliability and efficiency are important criteria in the design of interconnection networks. Connectivity is a widely used measurement for network fault-tolerance capacities, while diameter determines routing efficiency along individual paths. In pra
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7b55b22deaa8b351ef71d9658ccd11e8
https://doi.org/10.1007/bf01608486
https://doi.org/10.1007/bf01608486