1591 search results - page 160 / 319 » Random lifts of graphs |
161
click to vote
FOCS
2006
IEEE
16 years 16 days ago
2006
IEEE
We study a switch Markov chain on regular graphs, where switches are allowed only between links that are at distance 3; we call this the Flip. The motivation for studying the Flip...
175
click to vote
ICAPR
2005
Springer
16 years 11 hour ago
2005
Springer
The RW algorithm has been proposed recently to solve the exact graph matching problem. This algorithm exploits Random Walk theory to compute a topological signature which can be u...
152
click to vote
WEA
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. We consider how to maintain the topological order of a directed acyclic graph (DAG) in the presence of edge insertions and deletions. We present a new algorithm and, alth...
154
click to vote
BMVC
2001
15 years 9 months ago
2001
This paper describes a spectral method for graph-matching. We adopt a graphical models viewpoint in which the graph adjacency matrix is taken to represent the transition probabili...
163
click to vote
SODA
2008
ACM
15 years 8 months ago
2008
ACM
Given a point set P in the plane, the Delaunay graph with respect to axis-parallel rectangles is a graph defined on the vertex set P, whose two points p, q P are connected by an ...