Sciweavers

2063 search results - page 26 / 413
» connection 2007
Sort
View
PDP
2007
IEEE
15 years 4 months ago
SockMi: a solution for migrating TCP/IP connections
SockMi is a solution for the migration of TCP/IP connections between Linux systems. Only the migrating peer of the connection needs to reside on a Linux system. The migration is c...
Massimo Bernaschi, Francesco Casadei, Paolo Tassot...
67
Voted
ENDM
2007
75views more  ENDM 2007»
14 years 10 months ago
Graph classes with given 3-connected components: asymptotic counting and critical phenomena
Fix a family T of 3-connected graphs, and let G be the class of graphs whose 3connected components are the graphs in T . We present a general framework for analyzing such graph cl...
Omer Giménez, Marc Noy, Juan José Ru...
ALENEX
2003
137views Algorithms» more  ALENEX 2003»
14 years 12 months ago
The Markov Chain Simulation Method for Generating Connected Power Law Random Graphs
Graph models for real-world complex networks such as the Internet, the WWW and biological networks are necessary for analytic and simulation-based studies of network protocols, al...
Christos Gkantsidis, Milena Mihail, Ellen W. Zegur...
EJC
2006
14 years 10 months ago
Counting connected graphs asymptotically
We find the asymptotic number of connected graphs with k vertices and k - 1 + l edges when k, l approach infinity, reproving a result of Bender, Canfield and McKay. We use the pro...
Remco van der Hofstad, Joel Spencer
JCO
2007
128views more  JCO 2007»
14 years 10 months ago
Approximation algorithms and hardness results for labeled connectivity problems
Let G = (V, E) be a connected multigraph, whose edges are associated with labels specified by an integer-valued function L : E → N. In addition, each label ℓ ∈ N has a non-...
Refael Hassin, Jérôme Monnot, Danny S...