2310 search results - page 259 / 462 » Coloring Random Graphs |
STOC
1992
ACM
14 years 8 days ago
1992
ACM
Given an expander graph G = (V, E) and a set of q disjoint pairs of vertices in V , we are interested in finding for each pair (ai, bi), a path connecting ai to bi, such that the ...
ALGORITHMICA
2007
13 years 8 months ago
2007
We present a new algorithm to compute motorcycle graphs. It runs in O(n √ n log n) time when n is the number of motorcycles. We give a new characterization of the straight skele...
SADM
2008
13 years 7 months ago
2008
: In this paper, we introduce the concept of -orthogonal patterns to mine a representative set of graph patterns. Intuitively, two graph patterns are -orthogonal if their similarit...
IMC
2010
ACM
13 years 6 months ago
2010
ACM
Social networks provide interesting algorithmic properties that can be used to bootstrap the security of distributed systems. For example, it is widely believed that social networ...
PICS
2000
13 years 9 months ago
2000
The development and adoption of standards for the evaluation of digital camera resolution has helped foster the widespread use of slanted-edge-based analysis. In addition, the for...