Sciweavers

201 search results - page 5 / 41
» The Connectivity of addition Cayley graphs
Sort
View
ALENEX
2003
137views Algorithms» more  ALENEX 2003»
13 years 8 months ago
The Markov Chain Simulation Method for Generating Connected Power Law Random Graphs
Graph models for real-world complex networks such as the Internet, the WWW and biological networks are necessary for analytic and simulation-based studies of network protocols, al...
Christos Gkantsidis, Milena Mihail, Ellen W. Zegur...
SIAMDM
2008
79views more  SIAMDM 2008»
13 years 7 months ago
Testing Triangle-Freeness in General Graphs
In this paper we consider the problem of testing whether a graph is triangle-free, and more generally, whether it is H-free, for a fixed subgraph H. The algorithm should accept gr...
Noga Alon, Tali Kaufman, Michael Krivelevich, Dana...
ISCI
2011
13 years 2 months ago
Augmented k-ary n-cubes
We define an interconnection network AQn,k which we call the augmented kary n-cube by extending a k-ary n-cube in a manner analogous to the existing extension of an n-dimensional...
Yonghong Xiang, Iain A. Stewart
CDC
2008
IEEE
129views Control Systems» more  CDC 2008»
14 years 1 months ago
On the structure of graph edge designs that optimize the algebraic connectivity
— We take a structural approach to the problem of designing the edge weights in an undirected graph subject to an upper bound on their total, so as to maximize the algebraic conn...
Yan Wan, Sandip Roy, Xu Wang, Ali Saberi, Tao Yang...
CVPR
2008
IEEE
1042views Computer Vision» more  CVPR 2008»
14 years 9 months ago
Graph cut based image segmentation with connectivity priors
Graph cut is a popular technique for interactive image segmentation. However, it has certain shortcomings. In particular, graph cut has problems with segmenting thin elongated obj...
Sara Vicente, Vladimir Kolmogorov, Carsten Rother