Ching-Chi Lin

activity

20012016

most citedOrderly Spanning Trees with Applications

44 citations · 67 across the 5 of their papers we have counts for

collaborators

5 papers

cs.DS2016

A Linear-Time Algorithm for the Weighted Paired-Domination Problem on Block Graphs

Ching-Chi Lin, Cheng-Yu Hsieh

In a graph $G = (V, E)$ , a vertex subset $S \subseteq V (G)$ is said to be a dominating set of $G$ if every vertex not in $S$ is adjacent to a vertex in $S$ . A dominating set $S$ of $…

cs.DS2014

Linear-Time Algorithms for the Paired-Domination Problem in Interval Graphs and Circular-Arc Graphs

Ching-Chi Lin, Hai-Lun Tu

In a graph $G$ , a vertex subset $S \subseteq V (G)$ is said to be a dominating set of $G$ if every vertex not in $S$ is adjacent to a vertex in $S$ . A dominating set $S$ of a graph $…

cs.DS2004

Locally connected spanning trees on graphs

Ching-Chi Lin, Gerard J. Chang, Gen-Huey Chen

A locally connected spanning tree of a graph $G$ is a spanning tree $T$ of $G$ such that the set of all neighbors of $v$ in $T$ induces a connected subgraph of $G$ for every $v\in…

cs.DS2002★ 23 cited

Improved Compact Visibility Representation of Planar Graph via Schnyder's Realizer

Ching-Chi Lin, Hsueh-I Lu, I-Fan Sun

Let $G$ be an $n$ -node planar graph. In a visibility representation of $G$ , each node of $G$ is represented by a horizontal line segment such that the line segments representing an…

cs.DS2001★ 44 cited

Orderly Spanning Trees with Applications

Yi-Ting Chiang, Ching-Chi Lin, Hsueh-I Lu

We introduce and study the {\em orderly spanning trees} of plane graphs. This algorithmic tool generalizes {\em canonical orderings}, which exist only for triconnected plane graphs…