49 citations · 281 across the 22 of their papers we have counts for
Showing 2013 · cs.DSShow all
2 papers · 2 filters
cs.DS2013★ 16 cited
A Faster Algorithm to Recognize Even-Hole-Free Graphs
Hsien-Chih Chang, Hsueh-I Lu
We study the problem of determining whether an -node graph has an even hole, i.e., an induced simple cycle consisting of an even number of nodes. Conforti, Cornuéjols, Kapoo…
cs.DS2013★ 4 cited
Replacement Paths via Row Minima of Concise Matrices
Cheng-Wei Lee, Hsueh-I Lu
Matrix is {\em -concise} if the finite entries of each column of consist of or less intervals of identical numbers. We give an -time algorithm to compute the…