Zobrazeno 1 - 10
of 124
pro vyhledávání: '"Lin, Yixun"'
Publikováno v:
In Carbon October 2024 229
Publikováno v:
In Journal of Retailing and Consumer Services July 2024 79
Autor:
Lin, Lan, Lin, Yixun
The minimum stretch spaning tree problem for a grah G is to find a spaning tree T of G such as that the maximum distance in T between two adjacent vertices is minimized. The minimum value of this optimization problem gives rise to a grpah invariant {
Externí odkaz:
http://arxiv.org/abs/1807.08252
A well-studied geometric object in combinatorial optimization is the perfect matching polytope of a graph $G$. In any investigation concerning the perfect matching polytope, one may assume that $G$ is matching covered --- that is, it is a connected g
Externí odkaz:
http://arxiv.org/abs/1807.07339
Publikováno v:
In Journal of Cleaner Production 20 November 2022 376
Autor:
Lin, Lan, Lin, Yixun
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:
http://arxiv.org/abs/1712.03497
Autor:
Lin, Lan, Lin, Yixun
Publikováno v:
In Applied Mathematics and Computation 1 December 2020 386
Nancy G. Kinnersley and Michael A. Langston has determined the excluded minors for the class of graphs with path-width at most two by computer. Their list consisted of 110 graphs. Such a long list is difficult to handle and gives no insight to struct
Externí odkaz:
http://arxiv.org/abs/0910.4889
Autor:
Lin, Lan1 (AUTHOR) linlan@tongji.edu.cn, Lin, Yixun2 (AUTHOR) linyixun@zzu.edu.cn
Publikováno v:
Journal of Interconnection Networks. Apr2024, p1. 22p.
Autor:
Wang Xiumei, Lin Yixun
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://doaj.org/article/49cd50256e454e0cb1c0f004c2dc51b7