Sciweavers

82 search results - page 6 / 17
» Spanning Trees Short or Small
Sort
View
NETWORKING
2010
13 years 9 months ago
A Longitudinal Study of Small-Time Scaling Behavior of Internet Traffic
We carry out a longitudinal study of evolution of small-time scaling behavior of Internet traffic on the MAWI dataset spanning 8 years. MAWI dataset contains a number of anomalies ...
Himanshu Gupta, Vinay J. Ribeiro, Anirban Mahanti
RTCSA
1997
IEEE
13 years 11 months ago
On memory protection in real-time OS for small embedded systems
Memory protection is an important OS feature for the reliability and safety of real-time control systems. In this paper, we study the feasibility of memory protection in small emb...
Shoji Suzuki, Kang G. Shin
SWAT
2004
Springer
109views Algorithms» more  SWAT 2004»
14 years 27 days ago
Robust Subgraphs for Trees and Paths
Consider a graph problem which is associated with a parameter, for example, that of finding a longest tour spanning k vertices. The following question is natural: Is there a smal...
Refael Hassin, Danny Segev
WG
2005
Springer
14 years 1 months ago
Collective Tree 1-Spanners for Interval Graphs
Abstract. In this paper we study the existence of a small set T of spanning trees that collectively “1-span” an interval graph G. In particular, for any pair of vertices u, v w...
Derek G. Corneil, Feodor F. Dragan, Ekkehard K&oum...
ESA
2009
Springer
144views Algorithms» more  ESA 2009»
14 years 2 months ago
Narrow-Shallow-Low-Light Trees with and without Steiner Points
We show that for every set S of n points in the plane and a designated point rt ∈ S, there exists a tree T that has small maximum degree, depth and weight. Moreover, for every po...
Michael Elkin, Shay Solomon