1370 search results - page 132 / 274 » On grids in topological graphs |
157
click to vote
TC
1998
15 years 6 months ago
1998
—Loop networks (or Hamiltonian circulant graphs) are a popular class of fault-tolerant network topologies which include rings and complete graphs. For this class, the fundamental...
163
click to vote
SAC
2010
ACM
16 years 1 months ago
2010
ACM
This article addresses the problem of efficient multi-robot patrolling in a known environment. The proposed approach assigns regions to each mobile agent. Every region is represen...
182
click to vote
CSE
2009
IEEE
15 years 4 months ago
2009
IEEE
Edges in social network graphs can model sensitive relationships. In this paper, we consider the problem of edges anonymity in graphs. We propose a probabilistic notion of edge ano...
167
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
A barycentric mapping of a planar graph is a plane embedding in which every internal vertex is the average of its neighbours. A celebrated result of Tutte’s [16] is that if a pl...
184
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We present a method for proving upper bounds on the eigenvalues of the graph Laplacian. A main step involves choosing an appropriate "Riemannian" metric to uniformize th...