1949 search results - page 91 / 390 » Random graphs on surfaces |
ENDM
2006
15 years 4 months ago
2006
Jim Propp's rotor router model is a simple deterministic analogue of a random walk. Instead of distributing chips randomly, it serves the neighbors in a fixed order. We analy...
125
click to vote
ESA
2005
Springer
15 years 9 months ago
2005
Springer
We present an algorithm for finding shortest surface non-separating cycles in graphs embedded on surfaces in O(g3/2 V 3/2 log V + g5/2 V 1/2 ) time, where V is the number of vert...
125
click to vote
GD
1995
Springer
15 years 7 months ago
1995
Springer
It is a di cult problem to display large, complex graphs in a manner which furthers comprehension. A useful approach is to expand selected sections foci of the graph revealing de...
130
click to vote
JAC
2008
15 years 5 months ago
2008
Abstract. We consider simulations of graph automata. We introduce two local transformations on the neighborhood: splitting and merging. We explain how to use such transformations, ...
131
Voted
IPL
2010
15 years 2 months ago
2010
We show that any face hitting set of size n of a connected planar graph with a minimum degree of at least 3 is contained in a connected subgraph of size 5n − 6. Furthermore we s...