Sciweavers

463 search results - page 29 / 93
» The lattice dimension of a graph
Sort
View
SIAMDM
2008
50views more  SIAMDM 2008»
14 years 9 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
CORR
2011
Springer
205views Education» more  CORR 2011»
14 years 4 months ago
Detection of objects in noisy images and site percolation on square lattices
Abstract: We propose a novel probabilistic method for detection of objects in noisy images. The method uses results from percolation and random graph theories. We present an algori...
Mikhail A. Langovoy, Olaf Wittich
SIROCCO
1997
14 years 11 months ago
Static Frequency Assignment in Cellular Networks
A cellular network is generally modeled as a subgraph of the triangular lattice. In the static frequency assignment problem, each vertex of the graph is a base station in the netw...
Lata Narayanan, Sunil M. Shende
GD
2004
Springer
15 years 3 months ago
A Note on the Self-similarity of Some Orthogonal Drawings
Large graphs are difficult to browse and to visually explore. This note adds up evidence that some graph drawing techniques, which produce readable layouts when applied to medium-s...
Maurizio Patrignani
EJC
2008
14 years 9 months ago
Dyck paths with coloured ascents
We introduce a notion of Dyck paths with coloured ascents. For several ways of colouring, when the set of colours is itself some class of lattice paths, we establish bijections be...
Andrei Asinowski, Toufik Mansour