Sciweavers

1857 search results - page 27 / 372
» Minimum Degree Orderings
Sort
View
BROADNETS
2007
IEEE
14 years 5 months ago
Strategic deployment of network monitors for attack attribution
—Attacks launched over the Internet have become a pressing problem. Attackers make use of a variety of techniques to anonymize their traffic, in order to escape detection and pr...
Young June Pyun, Douglas S. Reeves
AINA
2006
IEEE
14 years 4 months ago
Autonomic Trust Prediction for Pervasive Systems
Pervasive computing is becoming a reality, thanks to advances in wireless networking and increased popularity of portable devices. Users of these devices will need support to deci...
Licia Capra, Mirco Musolesi
IWCMC
2006
ACM
14 years 4 months ago
SINR analysis for V-BLAST with ordered MMSE-SIC detection
A new way to determine the exact layer-wise SINR distribution for V-BLAST with successive interference cancellation at the receiver is presented. In contrast to previous publicati...
Ronald Böhnke, Karl-Dirk Kammeyer
COMBINATORICS
2004
93views more  COMBINATORICS 2004»
13 years 10 months ago
Degree Powers in Graphs with Forbidden Subgraphs
For every real p > 0 and simple graph G, set f (p, G) = uV (G) dp (u) , and let (r, p, n) be the maximum of f (p, G) taken over all Kr+1-free graphs G of order n. We prove tha...
Béla Bollobás, Vladimir Nikiforov
JCT
2010
75views more  JCT 2010»
13 years 9 months ago
Hamiltonian degree sequences in digraphs
We show that for each η > 0 every digraph G of sufficiently large order n is Hamiltonian if its out- and indegree sequences d+ 1 ≤ · · · ≤ d+ n and d− 1 ≤ · · · ...
Daniela Kühn, Deryk Osthus, Andrew Treglown