Fuzhou University

most citedDriving three atoms into a singlet state in an optical cavity via adiabatic passage of a dark state

15 citations

5 papers

math.CO2013

On total colorings of 1-planar graphs

Xin Zhang, Jianfeng Hou, Guizhen Liu

A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one other edge. In this paper, we confirm the total-coloring conjecture for 1-planar gra…

cs.DS2013

A Dynamic Programming Solution to a Generalized LCS Problem

Lei Wang, Xiaodong Wang, Yingjie Wu +1

In this paper, we consider a generalized longest common subsequence problem, the string-excluding constrained LCS problem. For the two input sequences $X$ and $Y$ of lengths $n$ an…

quant-ph2013★ 15 cited

Driving three atoms into a singlet state in an optical cavity via adiabatic passage of a dark state

Mei Lu, Yan Xia, Jie Song +1

In this paper, we propose an efficient scheme to drive three atoms in an optical cavity into a singlet state via adiabatic passage. Appropriate Rabi frequencies of the classical fi…

cs.DS2013★ 3 cited

Improved Approximation Algorithms for Computing k Disjoint Paths Subject to Two Constraints

Longkun Guo, Hong Shen, Kewen Liao

For a given graph $G$ with positive integral cost and delay on edges, distinct vertices $s$ and $t$ , cost bound $C \in Z^{+}$ and delay bound $D \in Z^{+}$ , the $k$ bi-constraint pat…

math.CO2012

3-Factor-criticality of vertex-transitive graphs

Heping Zhang, Wuyang Sun

A graph of order $n$ is $p$ -factor-critical, where $p$ is an integer of the same parity as $n$ , if the removal of any set of $p$ vertices results in a graph with a perfect matching…