23 citations · 322 across the 61 of their papers we have counts for
9 papers · 1 filter
Phase Transition of Degeneracy in Minor-Closed Families
Chun-Hung Liu, Fan Wei
Given an infinite family of graphs and a monotone property , an (upper) threshold for and is a "fastest growing" function…
Clustered Variants of Hajós' Conjecture
Chun-Hung Liu, David R. Wood
Hajós conjectured that every graph containing no subdivision of the complete graph is properly -colorable. This conjecture was disproved by Catlin. Indeed, the maximum…
Sparse Subspace Clustering via Two-Step Reweighted L1-Minimization: Algorithm and Provable Neighbor Recovery Rates
Jwo-Yuh Wu, Liang-Chi Huang, Ming-Hsun Yang +1
Sparse subspace clustering (SSC) relies on sparse regression for accurate neighbor identification. Inspired by recent progress in compressive sensing, this paper proposes a new spa…
Energy-Efficient Activation and Uplink Transmission for Cellular IoT
Chun-Hung Liu, Yu-Han Shen, Chia-Han Lee
Consider a large-scale cellular network in which base stations (BSs) serve massive Internet-of-Things (IoT) devices. Since IoT devices are powered by a capacity-limited battery, ho…
Clustered Coloring of Graphs Excluding a Subgraph and a Minor
Chun-Hung Liu, David R. Wood
A graph coloring has bounded clustering if each monochromatic component has bounded size. Equivalently, it is a partition of the vertices into induced subgraphs with bounded size c…
Clustered Graph Coloring and Layered Treewidth
Chun-Hung Liu, David R. Wood
A graph coloring has bounded clustering if each monochromatic component has bounded size. This paper studies such a coloring, where the number of colors depends on an excluded comp…