Sciweavers

3204 search results - page 89 / 641
» The Alcuin Number of a Graph
Sort
View
SIAMDM
2008
50views more  SIAMDM 2008»
13 years 8 months ago
Real Number Channel Assignments for Lattices
We consider the problem of assigning a numerical channel to each transmitter in a large regular array such that multiple levels of interference, which depend on the distance betwe...
Jerrold R. Griggs, Xiaohua Teresa Jin
SODA
2003
ACM
115views Algorithms» more  SODA 2003»
13 years 9 months ago
Random walks on the vertices of transportation polytopes with constant number of sources
We consider the problem of uniformly sampling a vertex of a transportation polytope with m sources and n destinations, where m is a constant. We analyse a natural random walk on t...
Mary Cryan, Martin E. Dyer, Haiko Müller, Lee...
DAM
2007
70views more  DAM 2007»
13 years 8 months ago
Path-kipas Ramsey numbers
For two given graphs F and H, the Ramsey number R(F, H) is the smallest positive integer p such that for every graph G on p vertices the following holds: either G contains F as a ...
A. N. M. Salman, H. J. Broersma
ESA
2007
Springer
100views Algorithms» more  ESA 2007»
14 years 2 months ago
Nash Equilibria in Voronoi Games on Graphs
In this paper we study a game where every player is to choose a vertex (facility) in a given undirected graph. All vertices (customers) are then assigned to closest facilities and...
Christoph Dürr, Nguyen Kim Thang
GBRPR
2007
Springer
14 years 2 months ago
Computing Homology Group Generators of Images Using Irregular Graph Pyramids
We introduce a method for computing homology groups and their generators of a 2D image, using a hierarchical structure i.e. irregular graph pyramid. Starting from an image, a hiera...
Samuel Peltier, Adrian Ion, Yll Haxhimusa, Walter ...