2079 search results - page 162 / 416 » Universality of random graphs |
194
click to vote
ICALP
2007
Springer
16 years 20 days ago
2007
Springer
Abstract. We deal with two intimately related subjects: quasi-randomness and regular partitions. The purpose of the concept of quasi-randomness is to measure how much a given graph...
168
click to vote
SIAMDM
2010
15 years 1 months ago
2010
The firefighter problem is the following discrete-time game on a graph. Initially, a fire starts at a vertex of the graph. In each round, a firefighter protects one vertex not yet ...
179
click to vote
CVPR
2012
IEEE
13 years 9 months ago
2012
IEEE
The k-NN graph has played a central role in increasingly popular data-driven techniques for various learning and vision tasks; yet, finding an efficient and effective way to con...
185
click to vote
FOCS
1998
IEEE
15 years 10 months ago
1998
IEEE
We consider the parametric minimum spanning tree problem, in which we are given a graph with edge weights that are linear functions of a parameter and wish to compute the sequenc...
170
click to vote
ICPP
2006
IEEE
16 years 16 days ago
2006
IEEE
stractions are extensively used to understand and solve challenging computational problems in various scientific and engineering domains. They have particularly gained prominence...