A complete partition of a graph G is a partition of its vertex set in which any two distinct classes are connected by an edge. Let cp(G) denote the maximum number of classes in a ...
We propose a scheme to introduce directionality in the Random Walker algorithm for image segmentation. In particular, we extend the optimization framework of this algorithm to com...
The 2-dimensional Hamming graph H(2, n) consists of the n2 vertices (i, j), 1 ≤ i, j ≤ n, two vertices being adjacent when they share a common coordinate. We examine random sub...
Remco van der Hofstad, Malwina J. Luczak, Joel Spe...
Abstract. Markov and Conditional random fields (CRFs) used in computer vision typically model only local interactions between variables, as this is computationally tractable. In t...
Several peer-to-peer networks are based upon randomized graph topologies that permit efficient greedy routing, e.g., randomized hypercubes, randomized Chord, skip-graphs and const...