Sciweavers

473 search results - page 2 / 95
» On stars and Steiner stars
Sort
View
AAIM
2011
Springer
337views Algorithms» more  AAIM 2011»
12 years 8 months ago
On Variants of the Spanning Star Forest Problem
A star forest is a collection of vertex-disjoint trees of depth at most 1, and its size is the number of leaves in all its components. A spanning star forest of a given graph G is ...
Jing He, Hongyu Liang
HOTI
2005
IEEE
13 years 10 months ago
Initial Performance Evaluation of the Cray SeaStar Interconnect
The Cray SeaStar is a new network interface and router for the Cray Red Storm and XT3 supercomputer. The SeaStar was designed specifically to meet the performance and reliability...
Ron Brightwell, Kevin T. Pedretti, Keith D. Underw...
TSMC
2002
98views more  TSMC 2002»
13 years 4 months ago
The STAR automaton: expediency and optimality properties
Abstract--We present the STack ARchitecture (STAR) automaton. It is a fixed structure, multiaction, reward-penalty learning automaton, characterized by a star-shaped state transiti...
Anastasios A. Economides, Athanasios Kehagias
CIARP
2003
Springer
13 years 10 months ago
Extended Star Clustering Algorithm
Abstract. In this paper we propose the extended star clustering algorithm and compare it with the original star clustering algorithm. We introduce a new concept of star and as a co...
Reynaldo Gil-García, José Manuel Bad...
APPROX
2007
Springer
115views Algorithms» more  APPROX 2007»
13 years 11 months ago
Improved Approximation Algorithms for the Spanning Star Forest Problem
A star graph is a tree of diameter at most two. A star forest is a graph that consists of node-disjoint star graphs. In the spanning star forest problem, given an unweighted graph ...
Ning Chen, Roee Engelberg, C. Thach Nguyen, Prasad...