Sciweavers

829 search results - page 10 / 166
» Distance domination-critical graphs
Sort
View
74
Voted
EJC
2002
14 years 11 months ago
Asymptotic Clique Covering Ratios of Distance Graphs
Daphne Der-Fen Liu, Xuding Zhu
COMBINATORICS
1998
87views more  COMBINATORICS 1998»
14 years 11 months ago
Crooked Functions, Bent Functions, and Distance Regular Graphs
T. D. Bending, Dmitry Fon-Der-Flaass
PVLDB
2011
14 years 2 months ago
Distance-Constraint Reachability Computation in Uncertain Graphs
Ruoming Jin, Lin Liu, Bolin Ding, Haixun Wang
KDD
2008
ACM
193views Data Mining» more  KDD 2008»
16 years 5 days ago
A family of dissimilarity measures between nodes generalizing both the shortest-path and the commute-time distances
This work introduces a new family of link-based dissimilarity measures between nodes of a weighted directed graph. This measure, called the randomized shortest-path (RSP) dissimil...
Luh Yen, Marco Saerens, Amin Mantrach, Masashi Shi...
ICDE
2008
IEEE
190views Database» more  ICDE 2008»
16 years 1 months ago
Efficient Query Processing in Large Traffic Networks
Abstract-- We present an original graph embedding to speedup distance-range and k-nearest neighbor queries on static and/or dynamic objects located on a (weighted) graph. Our metho...
Hans-Peter Kriegel, Matthias Renz, Peer Kröge...