1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.DM2012
The black-and-white coloring problem on circle graphs
Ton Kloks, Sheung-Hung Poon, Yue-Li Wang
Given a graph G and integers b and w. The black-and-white coloring problem asks if there exist disjoint sets of vertices B and W with |B|=b and |W|=w such that no two vertices x in…
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…