Zobrazeno 1 - 10
of 22
pro vyhledávání: '"Fei-Huang Chang"'
Autor:
Jen-Ling Shang, Fei-Huang Chang
Publikováno v:
Mathematics, Vol 10, Iss 12, p 2036 (2022)
An edge labeling of a graph G is a bijection f from E(G) to a set of |E(G)| integers. For a vertex u in G, the induced vertex sum of u, denoted by f+(u), is defined as f+(u)=∑uv∈E(G)f(uv). Graph G is said to be antimagic if it has an edge labelin
Externí odkaz:
https://doaj.org/article/0fd871d15e7645bca4b32734a66b21c3
Autor:
Fei-huang Chang, 張飛黃
93
The optimal partition problem considers the partition of n objects into p nonempty parts, and finding a partition(optimal partition) to maximize the objective function F:R^p-->R. A brute force method is to compare the values of objective func
The optimal partition problem considers the partition of n objects into p nonempty parts, and finding a partition(optimal partition) to maximize the objective function F:R^p-->R. A brute force method is to compare the values of objective func
Externí odkaz:
http://ndltd.ncl.edu.tw/handle/61878763207580339205
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:
Computational and Mathematical Methods in Medicine, Vol 2021 (2021)
Computational and Mathematical Methods in Medicine
Computational and Mathematical Methods in Medicine
Group testing (or pool testing), for example, Dorfman’s method or grid method, has been validated for COVID-19 RT-PCR tests and implemented widely by most laboratories in many countries. These methods take advantages since they reduce resources, ti
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c5220dc49140da02e7c6fc018eb29dcb
https://doi.org/10.1155/2021/6636396
https://doi.org/10.1155/2021/6636396
Publikováno v:
Graphs and Combinatorics. 37:1065-1082
The concept of antimagic labelings of a graph is to produce distinct vertex sums by labeling edges through consecutive numbers starting from one. A long-standing conjecture is that every connected graph, except a single edge, is antimagic. Some graph
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1c11e4b1396fc346cb09b29704cb9446
https://doi.org/10.1007/s00373-021-02305-w
https://doi.org/10.1007/s00373-021-02305-w
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:
Order. 35:349-362
Given a finite poset P, the intensively studied quantity La(n, P) denotes the largest size of a family of subsets of [n] not containing P as a weak subposet. Burcsi and Nagy (J. Graph Theory Appl. 1, 40–49 2013) proposed a double-chain method to ge
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7fdf2580038514e43804fd64696e28a9
https://doi.org/10.1007/s11083-017-9436-1
https://doi.org/10.1007/s11083-017-9436-1
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
Autor:
Fei-Huang Chang, Dániel Gerbner, Wei-Tian Li, Abhishek Methuku, Dániel T. Nagy, Balázs Patkós, Máté Vizer
We address the following rainbow Ramsey problem: For posets P, Q what is the smallest number n such that any coloring of the elements of the Boolean lattice Bn either admits a monochromatic copy of P or a rainbow copy of Q. We consider both weak and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c6f04cbde56160eab75486bf9ba597ba
http://arxiv.org/abs/1809.08629
http://arxiv.org/abs/1809.08629