1 citations · 2 across the 6 of their papers we have counts for
4 papers · 1 filter
Streaming Algorithms for Graph k-Matching with Optimal or Near-Optimal Update Time
Jianer Chen, Qin Huang, Iyad Kanj +2
We present streaming algorithms for the graph -matching problem in both the insert-only and dynamic models. Our algorithms, with space complexity matching the best upper bounds,…
Parameterized Algorithms for the Maximum Agreement Forest Problem on Multiple Rooted Multifurcating Trees
Feng Shi, Jianer Chen, Qilong Feng +1
The Maximum Agreement Forest problem has been extensively studied in phylogenetics. Most previous work is on two binary phylogenetic trees. In this paper, we study a generalized ve…
A -Vertex Kernel for Maximum Internal Spanning Tree
Wenjun Li, Jianxin Wang, Jianer Chen +1
We consider the parameterized version of the maximum internal spanning tree problem, which, given an -vertex graph and a parameter , asks for a spanning tree with at least $k…
Algorithms for Maximum Agreement Forest of Multiple General Trees
Feng Shi, Jianer Chen, Qilong Feng +2
The Maximum Agreement Forest (Maf) problem is a well-studied problem in evolutionary biology, which asks for a largest common subforest of a given collection of phylogenetic trees…