672 search results - page 30 / 135 » Lower-stretch spanning trees |
ICANN
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. The Self-Organising Map (SOM) is a well-known neuralnetwork model that has successfully been used as a data analysis tool in many different domains. The SOM provides a to...
TALG
2008
13 years 7 months ago
2008
Given a Euclidean graph G over a set P of n points in the plane, we are interested in verifying whether G is a Euclidean minimum spanning tree (EMST) of P or G differs from it in ...
CORR
2002
Springer
13 years 7 months ago
2002
Springer
Floor-planning is a fundamental step in VLSI chip design. Based upon the concept of orderly spanning trees, we present a simple O(n)-time algorithm to construct a floor-plan for a...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
We present a novel self-stabilizing algorithm for minimum spanning tree (MST) construction. The space complexity of our solution is O(log2 n) bits and it converges in O(n2 ) round...
PPSN
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in the design of centralized broadcasting ...