31 search results - page 1 / 7 » Combinatorial Network Abstraction by Trees and Distances |
ISAAC
2005
Springer
13 years 10 months ago
2005
Springer
MIAR
2006
IEEE
13 years 10 months ago
2006
IEEE
Abstract. In this paper, we present a novel approach to matching cerebral vascular trees obtained from 3D-RA data-sets based on minimization of tree edit distance. Our approach is ...
IWOCA
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. We analyze special random network models – so-called thickened trees – which are constructed by random trees where the nodes are replaced by local clusters. These obj...
DAM
2000
13 years 4 months ago
2000
This paper deals with facility location problems with pos=neg weights in trees. We consider two di erent objective functions which model two di erent ways to handle obnoxious faci...
CORR
2011
Springer
12 years 12 months ago
2011
Springer
Abstract—This paper addresses combinatorial optimization schemes for solving the multicriteria Steiner tree problem for communication network topology design (e.g., wireless mesh...