Sciweavers

1972 search results - page 272 / 395
» connection 2008
Sort
View
184
Voted
CLEIEJ
1998
134views more  CLEIEJ 1998»
15 years 6 months ago
Firewall Monitoring
Securing resources against unauthorized access and/or use is a major concern of every organization that uses computer networks. To protect internal networks from external attacks,...
Ernst L. Leiss, Jianyu You
190
Voted
DM
1998
95views more  DM 1998»
15 years 6 months ago
An Euler-type formula for median graphs
Let G be a median graph on n vertices and m edges and let k be the number of equivalence classes of the Djokovi´c’s relation Θ defined on the edge-set of G. Then 2n − m −...
Sandi Klavzar, Henry Martyn Mulder, Riste Skrekovs...
187
Voted
CN
1999
84views more  CN 1999»
15 years 6 months ago
Implementation of the pan-European academic research network: TEN-155
This paper addresses the implementation of a pan-European network to support co-operative research amongst European researchers: TEN-155. Predecessors to TEN-155 were TEN-34 and E...
Roberto Sabatino, Jose Manuel de Arce
204
Voted
DAM
1999
128views more  DAM 1999»
15 years 6 months ago
Graph Classes Between Parity and Distance-hereditary Graphs
Several graph problems (e.g., steiner tree, connected domination, hamiltonian path, and isomorphism problem), which can be solved in polynomial time for distance-hereditary graphs...
Serafino Cicerone, Gabriele Di Stefano
SIAMDM
1998
95views more  SIAMDM 1998»
15 years 6 months ago
The Graphs with All Subgraphs T-Perfect
The richest class of t-perfect graphs known so far consists of the graphs with no so-called odd-K4. Clearly, these graphs have the special property that they are hereditary t-perfe...
A. M. H. Gerards, F. Bruce Shepherd