Sciweavers

511 search results - page 42 / 103
» The intrinsic dimensionality of graphs
Sort
View
GCC
2003
Springer
14 years 3 months ago
Some Grid Automata for Grid Computing
We use 2-Dimensional language to construct 2-Dimensional computer graphics model, use MSO or other logics to specify some graph property, and use automata model checking technique ...
Hao Shen, Yongqiang Sun
PPL
1998
117views more  PPL 1998»
13 years 9 months ago
Messy Broadcasting
In this paper, we describe an ordering of the vertices of a 2-dimensional torus and study the upper bound on the orderly broadcast time. Along with messy broadcasting, orderly bro...
Hovhannes A. Harutyunyan, Arthur L. Liestman
SMI
2010
IEEE
159views Image Analysis» more  SMI 2010»
13 years 7 months ago
X-maps: An Efficient Model for Non-manifold Modeling
Abstract--Many representation schemes have been proposed to deal with non-manifold and mixed dimensionalities objects. A majority of those models are based on incidence graphs and ...
David Cazier, Pierre Kraemer
DAM
2008
67views more  DAM 2008»
13 years 10 months ago
On the variance of Shannon products of graphs
We study the combinatorial problem of finding an arrangement of distinct integers into the ddimensional N-cube so that the maximal variance of the numbers on each -dimensional sec...
József Balogh, Clifford D. Smyth
ENDM
2000
131views more  ENDM 2000»
13 years 9 months ago
Some Topological Methods in Graph Coloring Theory
Attempts to solve the famous Four Color Problem led to fruitful discoveries and rich coloring theories. In this talk, some old and some recent applications of tools from topology ...
Bojan Mohar