M
Mingyu Xiao
Researcher at University of Electronic Science and Technology of China
Publications - 134
Citations - 1086
Mingyu Xiao is an academic researcher from University of Electronic Science and Technology of China. The author has contributed to research in topics: Computer science & Vertex (geometry). The author has an hindex of 15, co-authored 101 publications receiving 861 citations. Previous affiliations of Mingyu Xiao include The Chinese University of Hong Kong.
Papers
More filters
Journal ArticleDOI
Exact algorithms for maximum independent set
Mingyu Xiao,Hiroshi Nagamochi +1 more
TL;DR: It is shown that the maximum independent set problem on an n-vertex graph can be solved in 1.1996 n n O ( 1 ) time and polynomial space, which even is faster than Robson's 1.2109 n n -time exponential-space algorithm published in 1986.
Book ChapterDOI
Exact Algorithms for Maximum Independent Set
Mingyu Xiao,Hiroshi Nagamochi +1 more
TL;DR: It is shown that the maximum independent set problem (MIS) on an n-vertex graph can be solved in 1.2002 n n O(1) time and polynomial space, which is even faster than Robson’s 1.2109 n nO(1)-time exponential-space algorithm published in 1986.
Journal ArticleDOI
Simple and Improved Parameterized Algorithms for Multiterminal Cuts
TL;DR: This paper designs several simple and improved algorithms for Multiterminal Cut, based on a notion farthest minimum isolating cut, and shows that Edge MultiterMinal Cut can be solved in O(2lkT(n,m)) time and Vertex Multiter Minal CutCan be solvedIn O(klT( n,m) time, where T(n),m)=O(min (n2/3,m1/2)m).
Journal ArticleDOI
Confining sets and avoiding bottleneck cases: A simple maximum independent set algorithm in degree-3 graphs
Mingyu Xiao,Hiroshi Nagamochi +1 more
TL;DR: An O^*(1.0836^n)-time algorithm for finding a maximum independent set in an n-vertex graph with degree bounded by 3 is presented, which improves all previous running time bounds for this problem.
Journal ArticleDOI
Exact algorithms for the maximum dissociation set and minimum 3-path vertex cover problems
Mingyu Xiao,Shaowei Kou +1 more
TL;DR: Some interesting structural properties of the dissociation sets and 3-path vertex covers of maximum size and minimum size in graphs are revealed, which allow them to be solved in O * ( 1.4656 n ) time and polynomial space or O *( 1.3659 n) time and exponential space.