Sciweavers

458 search results - page 34 / 92
» Distance graphs: from random geometric graphs to Bernoulli g...
Sort
View
SAC
2009
ACM
14 years 3 months ago
Visualization of clustered directed acyclic graphs with node interleaving
Graph drawing and visualization represent structural information ams of abstract graphs and networks. An important subset of graphs is directed acyclic graphs (DAGs). E-Spring alg...
Pushpa Kumar, Kang Zhang
ISAAC
2000
Springer
110views Algorithms» more  ISAAC 2000»
14 years 8 days ago
Online Routing in Convex Subdivisions
We consider online routing algorithms for finding paths between the vertices of plane graphs. We show (1) there exists a routing algorithm for arbitrary triangulations that has no...
Prosenjit Bose, Pat Morin, Andrej Brodnik, Svante ...
EVOW
2009
Springer
14 years 3 months ago
Diversity Control and Multi-Parent Recombination for Evolutionary Graph Coloring Algorithms
We present a hybrid evolutionary algorithm for the graph coloring problem (Evocol). Evocol is based on two simple-but-effective ideas. First, we use an enhanced crossover that col...
Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz
CVPR
2007
IEEE
14 years 10 months ago
An MRF and Gaussian Curvature Based Shape Representation for Shape Matching
Matching and registration of shapes is a key issue in Computer Vision, Pattern Recognition, and Medical Image Analysis. This paper presents a shape representation framework based ...
Pengdong Xiao, Nick Barnes, Tibério S. Caet...
INFOCOM
2011
IEEE
13 years 12 days ago
Sharing multiple messages over mobile networks
—Information dissemination in a large network is typically achieved when each user shares its own information or resources with each other user. Consider n users randomly located...
Yuxin Chen, Sanjay Shakkottai, Jeffrey G. Andrews