5606 search results - page 245 / 1122 » Randomization Techniques for Graphs. |
131
click to vote
CHI
2009
ACM
16 years 7 months ago
2009
ACM
Scientists, engineers, and educators commonly need to make graphs that quickly illustrate quantitative ideas yet are not based on specific data sets. We call these graphs quantita...
168
click to vote
TPHOL
2008
IEEE
16 years 25 days ago
2008
IEEE
Although graphs are very common in computer science, they are still very difficult to handle for proof assistants as proving properties of graphs may require heavy computations. T...
190
click to vote
COMBINATORICS
2000
15 years 6 months ago
2000
In this article, Temperley's bijection between spanning trees of the square grid on the one hand, and perfect matchings (also known as dimer coverings) of the square grid on ...
194
click to vote
TCOS
2010
15 years 4 months ago
2010
We propose an approximation method to answer point-to-point shortest path queries in undirected edge-weighted graphs, based on random sampling and Voronoi duals. We compute a simp...
185
click to vote
KDD
2008
ACM
16 years 6 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...