Zobrazeno 1 - 10
of 78
pro vyhledávání: '"Yixun Lin"'
Publikováno v:
International Journal of Foundations of Computer Science. 34:347-361
The bipartization problem for a graph [Formula: see text] asks for finding a subset [Formula: see text] of [Formula: see text] such that the induced subgraph [Formula: see text] is bipartite and [Formula: see text] is maximized. This problem has sign
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ee6435591078826277afc5daae595a61
https://doi.org/10.1142/s0129054122500198
https://doi.org/10.1142/s0129054122500198
Publikováno v:
Acta Mathematicae Applicatae Sinica, English Series. 37:510-522
With applications in distribution systems and communication networks, the minimum stretch spanning tree problem is to find a spanning tree T of a graph G such that the maximum distance in T between two adjacent vertices is minimized. The problem has
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1d3c3096a14197a10fa87067737ca40b
https://doi.org/10.1007/s10255-021-1028-6
https://doi.org/10.1007/s10255-021-1028-6
Publikováno v:
Advances in Psychological Science. 29:610-624
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1c8759d75f3191ec8d5df71125892efc
https://doi.org/10.3724/sp.j.1042.2021.00610
https://doi.org/10.3724/sp.j.1042.2021.00610
Publikováno v:
Journal of Cleaner Production. 376:134168
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5bf745f1bca27e4bd625280414063e6f
https://doi.org/10.1016/j.jclepro.2022.134168
https://doi.org/10.1016/j.jclepro.2022.134168
Autor:
XIUMEI WANG1 wangxiumei@zzu.edu.cn, YIXUN LIN1
Publikováno v:
Discussiones Mathematicae: Graph Theory. 2018, Vol. 38 Issue 1, p189-201. 13p.
Publikováno v:
RAIRO - Operations Research. 52:359-370
In the due date assignment, the bicriteria scheduling models are motivated by the trade-off between the due date assignment cost and a performance criterion of the scheduling system. The bicriteria scheduling models related to the maximum tardiness a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7fbeaa77e5e762540c9bde7f19f58b48
https://doi.org/10.1051/ro/2017074
https://doi.org/10.1051/ro/2017074
Autor:
Yixun Lin, Xiumei Wang
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 38, Iss 1, Pp 189-201 (2018)
For a 2-connected cubic graph G, the perfect matching polytope P(G) of G contains a special point xc=(13,13,…,13)$x^c = \left( {{1 \over 3},{1 \over 3}, \ldots ,{1 \over 3}} \right)$ . The core index ϕ(P(G)) of the polytope P(G) is the minimum num
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ae3ca2ddeb42871f5662b214452c0a4c
https://doaj.org/article/49cd50256e454e0cb1c0f004c2dc51b7
https://doaj.org/article/49cd50256e454e0cb1c0f004c2dc51b7
Publikováno v:
Proceedings of the Pacific Asia Conference on Information Systems (PACIS); 2021, p1-8, 8p
Publikováno v:
Applied Mathematics and Computation. 386:125502
The minimum stretch spanning tree problem for a graph G is to find a spanning tree T of G such that the maximum distance in T between two adjacent vertices of G is minimized, where the minimum value is called the tree-stretchof G. There has been exte
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::29682c0818bb8259c9358a4f2998f07f
https://doi.org/10.1016/j.amc.2020.125502
https://doi.org/10.1016/j.amc.2020.125502