3 citations · 6 across the 9 of their papers we have counts for
9 papers
Deduction, Constrained Zero Forcing, and Constrained Searching
Andrea Burgess, Danny Dyer, Kerry Ojakian +3
Deduction is a recently introduced graph searching process in which searchers clear the vertex set of a graph with one move each, with each searcher's movement determined by which…
Approximately covering vertices by order- or longer paths
Mingyang Gong, Zhi-Zhong Chen, Guohui Lin +1
This paper studies , which is to cover as many vertices as possible in a given graph by vertex-disjoint -paths (i.e., paths each with at least five verti…
Randomized algorithms for fully online multiprocessor scheduling with testing
Mingyang Gong, Zhi-Zhong Chen, Guohui Lin +1
We contribute the first randomized algorithm that is an integration of arbitrarily many deterministic algorithms for the fully online multiprocessor scheduling with testing problem…
Men Can't Always be Transformed into Mice: Decision Algorithms and Complexity for Sorting by Symmetric Reversals
Xin Tong, Yixiao Yu, Ziyi Fang +4
Sorting a permutation by reversals is a famous problem in genome rearrangements. Since 1997, quite some biological evidence were found that in many genomes the reversed regions are…
A Cubic-Time 2-Approximation Algorithm for rSPR Distance
Zhi-Zhong Chen, Eita Machida, Lusheng Wang
Due to hybridization events in evolution, studying two different genes of a set of species may yield two related but different phylogenetic trees for the set of species. In this ca…
Approximation algorithms for the maximum weight internal spanning tree problem
Zhi-Zhong Chen, Guohui Lin, Lusheng Wang +2
Given a vertex-weighted connected graph , the maximum weight internal spanning tree (MwIST for short) problem asks for a spanning tree of such that the total we…