49 citations · 74 across the 40 of their papers we have counts for
6 papers · 2 filters
Optimal Augmentation for Bipartite Componentwise Biconnectivity in Linear Time
Tsan-sheng Hsu, Ming-Yang Kao
A graph is componentwise biconnected if every connected component either is an isolated vertex or is biconnected. We present a linear-time algorithm for the problem of adding the s…
Common-Face Embeddings of Planar Graphs
Zhi-Zhong Chen, Xin He, Ming-Yang Kao
Given a planar graph G and a sequence C_1,...,C_q, where each C_i is a family of vertex subsets of G, we wish to find a plane embedding of G, if any exists, such that for each i in…
Compact Encodings of Planar Graphs via Canonical Orderings and Multiple Parentheses
Richie Chih-Nan Chuang, Ashim Garg, Xin He +2
Let G be a plane graph of n nodes, m edges, f faces, and no self-loop. G need not be connected or simple (i.e., free of multiple edges). We give three sets of coding schemes for G…
Linear-Time Succinct Encodings of Planar Graphs via Canonical Orderings
Xin He, Ming-Yang Kao, Hsueh-I Lu
Let G be an embedded planar undirected graph that has n vertices, m edges, and f faces but has no self-loop or multiple edge. If G is triangulated, we can encode it using {4/3}m-1…
On-Line Difference Maximization
Ming-Yang Kao, Stephen R. Tate
In this paper we examine problems motivated by on-line financial problems and stochastic games. In particular, we consider a sequence of entirely arbitrary distinct values arriving…
A Fast General Methodology for Information-Theoretically Optimal Encodings of Graphs
Xin He, Ming-Yang Kao, Hsueh-I Lu
We propose a fast methodology for encoding graphs with information-theoretically minimum numbers of bits. Specifically, a graph with property pi is called a pi-graph. If pi satisfi…