Sciweavers

480 search results - page 5 / 96
» connection 2002
Sort
View
81
Voted
VC
2002
67views more  VC 2002»
15 years 2 months ago
Detecting and reconstructing subdivision connectivity
In this paper we introduce fast and ef
Gabriel Taubin
97
Voted
DM
2002
104views more  DM 2002»
15 years 2 months ago
4-connected maximal planar graphs are 4-ordered
It is shown that in a 4-connected maximal planar graph there is for any four vertices a, b, c and d, a cycle in the graph that contains the four vertices and visits them in the or...
Wayne Goddard
89
Voted
CN
2002
89views more  CN 2002»
15 years 2 months ago
A compound model for TCP connection arrivals for LAN and WAN applications
We propose a two level model for TCP connection arrivals in local area networks (LAN). The
Carl Nuzman, Iraj Saniee, Wim Sweldens, Alan Weiss
101
Voted
DAM
2002
120views more  DAM 2002»
15 years 2 months ago
Connectivity and fault-tolerance of hyperdigraphs
Directed hypergraphs are used to model networks whose nodes are connected by directed buses. We study in this paper two parameters related to the fault-tolerance of directed bus n...
Daniela Ferrero, Carles Padró
130
Voted
ENDM
2002
91views more  ENDM 2002»
15 years 2 months ago
On minimally 3-connected graphs on a surface
It is well-known that the maximal size of minimally 3-connected graphs of order 7n is 93 -n . In this paper, we shall prove that if G is a minimally 3-connected graph of order n, ...
Katsuhiro Ota