1 citations · 1 across the 7 of their papers we have counts for
5 papers · 1 filter
P_3-Games on Chordal Bipartite Graphs
Wing-Kai Hon, Ton Kloks, Fu-Hong Liu +3
Let G=(V,E) be a connected graph. A set U subseteq V is convex if G[U] is connected and all vertices of V\U have at most one neighbor in U. Let sigma(W) denote the unique smallest…
Convex Independence in Permutation Graphs
Wing-Kai Hon, Ton Kloks, Fu-Hong Liu +1
A set C of vertices of a graph is P_3-convex if every vertex outside C has at most one neighbor in C. The convex hull σ(A) of a set A is the smallest P_3-convex set that contains A…
P_3-Games
Wing-Kai Hon, Ton Kloks, Fu-Hong Liu +2
Without further ado, we present the P_3-game. The P_3-game is decidable for elementary classes of graphs such as paths and cycles. From an algorithmic point of view, the connected…
On the Grundy number of Cameron graphs
Wing-Kai Hon, Ton Kloks, Fu-Hong Liu +2
The Grundy number of a graph is the maximal number of colors attained by a first-fit coloring of the graph. The class of Cameron graphs is the Seidel switching class of cographs. I…
Non-preemptive Scheduling in a Smart Grid Model and its Implications on Machine Minimization
Fu-Hong Liu, Hsiang-Hsuan Liu, Prudence W. H. Wong
We study a scheduling problem arising in demand response management in smart grid. Consumers send in power requests with a flexible feasible time interval during which their reques…