Zobrazeno 1 - 10
of 71
pro vyhledávání: '"Wensong Lin"'
Autor:
Yuquan Lin, Wensong Lin
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 44, Iss 4, p 1311 (2024)
Externí odkaz:
https://doaj.org/article/466b8f529d364ee1ac9707d19837c41f
Autor:
Yun Feng, Wensong Lin
Publikováno v:
Symmetry, Vol 14, Iss 7, p 1327 (2022)
Erdős–Faber–Lovász conjecture states that if a graph G is a union of the n edge-disjoint copies of complete graph Kn, that is, each pair of complete graphs has at most one shared vertex, then the chromatic number of graph G is n. In fact, we on
Externí odkaz:
https://doaj.org/article/7ec701c0c73841feaf34b3cba5a15a28
Autor:
Yun Feng, Wensong Lin
Publikováno v:
Mathematica Bohemica, Vol 141, Iss 4, Pp 431-455 (2016)
A vertex $k$-coloring of a graph $G$ is a \emph{multiset $k$-coloring} if $M(u)\neq M(v)$ for every edge $uv\in E(G)$, where $M(u)$ and $M(v)$ denote the multisets of colors of the neighbors of $u$ and $v$, respectively. The minimum $k$ for which $G$
Externí odkaz:
https://doaj.org/article/b843fed1e89e48479f0265ce4b24c21b
Publikováno v:
Mini-Reviews in Organic Chemistry. 20:227-239
Abstract: Removing harmful species from water is essential for the protection of the environment and human health. Among various treatment techniques, adsorption is particularly attractive because of its advantages of easy operation, high removal eff
Publikováno v:
ACS Applied Materials & Interfaces. 15:18620-18629
Publikováno v:
Journal of Materials Research. 37:3761-3772
Publikováno v:
Reaction Kinetics, Mechanisms and Catalysis. 135:3447-3459
Autor:
Yuquan Lin, Wensong Lin
Publikováno v:
Discussiones Mathematicae Graph Theory.
NP-Hardness and Approximation Algorithms for Iterative Pricing on Social Networks with Externalities
Autor:
Wensong Lin, Chenli Shen
Publikováno v:
International Journal of Foundations of Computer Science. 32:957-979
We study how a monopolist seller should price an indivisible product iteratively to the consumers who are connected by a known link-weighted directed social network. For two consumers [Formula: see text] and [Formula: see text], there is an arc direc