1 citations · 1 across the 4 of their papers we have counts for
5 papers
Approximation Algorithm of Minimum All-Ones Problem for Arbitrary Graphs
Chen Wang, Chao Wang, Gregory Z. Gutin +1
Let be a graph and let each vertex of has a lamp and a button. Each button can be of -type or -type. Assume that initially some lamps are on and others are o…
Acceleration for Timing-Aware Gate-Level Logic Simulation with One-Pass GPU Parallelism
Weijie Fang, Yanggeng Fu, Jiaquan Gao +3
Witnessing the advancing scale and complexity of chip design and benefiting from high-performance computation technologies, the simulation of Very Large Scale Integration (VLSI) Ci…
Composition operators on weighted spaces of a tree
Han Xu, Xiaoyan Zhang
In this paper, we study the boundedness, compactness and Schatten class membership of composition operators on the weighted -space of a tree with $1\leq p <\inf…
Toeplitz operators on -spaces of a tree
Mingmei Huang, Xiaoyan Zhang, Xianfeng Zhao
Let be a rooted, countable infinite tree without terminal vertices. In the present paper, we characterize the spectra, self-adjointness and positivity of Toeplitz operators on…
A minimum semi-degree sufficient condition for one-to-many disjoint path covers in semicomplete digraphs
Ansong Ma, Yuefang Sun, Xiaoyan Zhang
Let be a digraph. We define the minimum semi-degree of as . Let be a positive integer, and let and $T = \{t_{1}, \d…