Sciweavers

2365 search results - page 105 / 473
» All things are connected
Sort
View
DCG
2008
82views more  DCG 2008»
15 years 1 months ago
Schnyder Woods and Orthogonal Surfaces
In this paper we study connections between planar graphs, Schnyder woods, and orthogonal surfaces. Schnyder woods and the face counting approach have important applications in gra...
Stefan Felsner, Florian Zickfeld
IPL
2008
68views more  IPL 2008»
15 years 1 months ago
The hub number of a graph
A hub set in a graph G is a set U V (G) such that any two vertices outside U are connected by a path whose internal vertices lie in U. We prove that h(G) hc(G) c(G) h(G) + 1, ...
Tracy Grauman, Stephen G. Hartke, Adam Jobson, Bil...
COMCOM
2007
89views more  COMCOM 2007»
15 years 1 months ago
On-the-fly TCP path selection algorithm in access link load balancing
—Many enterprises install multiple access links for fault tolerance or bandwidth enlargement. Dispatching connections through good links is the ultimate goal in utilizing multipl...
Ying-Dar Lin, Shih-Chiang Tsao, Un-Pio Leong
JGT
2006
98views more  JGT 2006»
15 years 1 months ago
Group chromatic number of planar graphs of girth at least 4
Jeager et al introduced a concept of group connectivity as an generalization of nowhere zero flows and its dual concept group coloring, and conjectured that every 5-edge connected...
Hong-Jian Lai, Xiangwen Li
IJON
2007
132views more  IJON 2007»
15 years 1 months ago
Emergence of population synchrony in a layered network of the cat visual cortex
Recently, a quantitative wiring diagram for the local neuronal network of cat visual cortex was described [T. Binzegger, R.J. Douglas, K.A.C. Martin, A quantitative map of the cir...
Jens Kremkow, Arvind Kumar, Stefan Rotter, Ad Aert...