18 citations · 19 across the 2 of their papers we have counts for
2 papers
cs.DS2017★ 18 cited
An Parameterized Algorithm for the Multiterminal Cut Problem
Yixin Cao, Jianer Chen, Jia-Hao Fan
We study the \emph{multiterminal cut} problem, which, given an -vertex graph whose edges are integer-weighted and a set of terminals, asks for a partition of the vertex set such…
cs.CG2010★ 1 cited
Complexity Analysis of Balloon Drawing for Rooted Trees
Chun-Cheng Lin, Hsu-Chun Yen, Sheung-Hung Poon +1
In a balloon drawing of a tree, all the children under the same parent are placed on the circumference of the circle centered at their parent, and the radius of the circle centered…