2 citations · 5 across the 19 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…
A linear time algorithm for the next-to-shortest path problem on undirected graphs with nonnegative edge lengths
Bang Ye Wu, Jun-Lin Guo, Yue-Li Wang
For two vertices and in a graph , the next-to-shortest path is an -path which length is minimum amongst all -paths strictly longer than the shortest path l…
On the strong chromatic index and maximum induced matching of tree-cographs and permutation graphs
Ton Kloks, Chin-Ting Ung, Yue-Li Wang
We show that there exist linear-time algorithms that compute the strong chromatic index and a maximum induced matching of tree-cographs when the decomposition tree is a part of the…
Algorithms for the strong chromatic index of Halin graphs, distance-hereditary graphs and maximal outerplanar graphs
Ton Kloks, Sheung-Hung Poon, Chin-Ting Ung +1
We show that there exist linear-time algorithms that compute the strong chromatic index of Halin graphs, of maximal outerplanar graphs and of distance-hereditary graphs.
A linear-time algorithm for the strong chromatic index of Halin graphs
Ton Kloks, Yue-Li Wang
We show that there exists a linear-time algorithm that computes the strong chromatic index of Halin graphs.