3 citations · 3 across the 2 of their papers we have counts for
3 papers
stat.ML2017
A New Family of Near-metrics for Universal Similarity
Chu Wang, Iraj Saniee, William S. Kennedy +1
We propose a family of near-metrics based on local graph diffusion to capture similarity for a wide class of data sets. These quasi-metametrics, as their names suggest, dispense wi…
cs.DS2016
Fast approximation algorithms for -centres in large -hyperbolic graphs
Katherine Edwards, W. Sean Kennedy, Iraj Saniee
We provide a quasilinear time algorithm for the -center problem with an additive error less than or equal to 3 times the input graph's hyperbolic constant. Specifically, for the…
cs.DM2011★ 3 cited
Finding a smallest odd hole in a claw-free graph using global structure
W. Sean Kennedy, Andrew D. King
A lemma of Fouquet implies that a claw-free graph contains an induced , contains no odd hole, or is quasi-line. In this paper we use this result to give an improved shortest-o…