3396 search results - page 244 / 680 » Tree representations of graphs |
120
click to vote
DISOPT
2008
15 years 3 months ago
2008
We define the k-path tree matroid, and use it to solve network design problems in which the required connectivity is arbitrary for a given pair of nodes, and 1 for the other pairs...
128
click to vote
GECCO
2004
Springer
15 years 8 months ago
2004
Springer
In this paper, we consider a variation of the Euclidean Steiner Tree Problem in which the space underlying the set of nodes has a specified non-uniform cost structure. This proble...
126
click to vote
CCCG
2008
15 years 4 months ago
2008
Let G be a graph embedded in the L1-plane. The stretch factor of G is the maximum over all pairs of distinct vertices p and q of G of the ratio LG 1 (p, q)/L1(p, q), where LG 1 (p...
142
click to vote
SODA
1998
ACM
15 years 4 months ago
1998
ACM
We introduce a new set of probabilistic analysis tools based on the analysis of And-Or trees with random inputs. These tools provide a unifying, intuitive, and powerful framework ...
146
click to vote
ICANN
2010
Springer
15 years 4 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...