Sciweavers

110 search results - page 16 / 22
» endm 2010
Sort
View
ENDM
2006
70views more  ENDM 2006»
13 years 7 months ago
Quasirandomness in Graphs
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...
Benjamin Doerr, Tobias Friedrich
ENDM
2006
77views more  ENDM 2006»
13 years 7 months ago
A Two-stage Model for a Day-ahead Paratransit Planning Problem
We consider a dynamic planning problem for paratransit transportation. The focus is on a decision to take one day ahead: which requests to serve with own vehicles, and which reque...
Maria L. A. G. Cremers, Willem K. Klein Haneveld, ...
ENDM
2006
91views more  ENDM 2006»
13 years 7 months ago
There are exactly five biplanes with k=11
A biplane is a 2-(k(k - 1)/2 + 1, k, 2) symmetric design. Only sixteen nontrivial biplanes are known: there are exactly nine biplanes with k < 11, at least five biplanes with k...
Patric R. J. Östergård, Petteri Kaski
ENDM
2006
57views more  ENDM 2006»
13 years 7 months ago
One-point extensions of generalized hexagons and octagons
In this note, we prove the uniqueness of the one-point extension S of a generalized hexagon of order 2 and prove the non-existence of such an extension S of any other finite gener...
Hans Cuypers, A. De Wispelaere, Hendrik Van Maldeg...
ENDM
2007
75views more  ENDM 2007»
13 years 7 months ago
Graph classes with given 3-connected components: asymptotic counting and critical phenomena
Fix a family T of 3-connected graphs, and let G be the class of graphs whose 3connected components are the graphs in T . We present a general framework for analyzing such graph cl...
Omer Giménez, Marc Noy, Juan José Ru...