267 search results - page 23 / 54 » Anti-Ramsey properties of random graphs |
ECML
2004
Springer
14 years 2 months ago
2004
Springer
This work presents a novel procedure for computing (1) distances between nodes of a weighted, undirected, graph, called the Euclidean Commute Time Distance (ECTD), and (2) a subspa...
JGT
2007
13 years 8 months ago
2007
Laman’s characterization of minimally rigid 2-dimensional generic frameworks gives a matroid structure on the edge set of the underlying graph, as was first pointed out and expl...
ICML
2006
IEEE
14 years 9 months ago
2006
IEEE
We consider the problem of clustering in its most basic form where only a local metric on the data space is given. No parametric statistical model is assumed, and the number of cl...
SAC
2010
ACM
14 years 3 months ago
2010
ACM
We consider self-stabilizing and self-organizing distributed construction of a spanner that forms an expander. The following results are presented. • A randomized technique to r...
KDD
2008
ACM
14 years 9 months ago
2008
ACM
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...