Sciweavers

31 search results - page 1 / 7
» Combinatorial Network Abstraction by Trees and Distances
Sort
View
ISAAC
2005
Springer
88views Algorithms» more  ISAAC 2005»
14 years 4 months ago
Combinatorial Network Abstraction by Trees and Distances
Stefan Eckhardt, Sven Kosub, Moritz G. Maaß,...
MIAR
2006
IEEE
14 years 4 months ago
Cerebral Vascular Tree Matching of 3D-RA Data Based on Tree Edit Distance
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 ...
Tommy W. H. Tang, Albert C. S. Chung
IWOCA
2009
Springer
134views Algorithms» more  IWOCA 2009»
14 years 5 months ago
Combinatorial Models for Cooperation Networks
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...
Michael Drmota, Bernhard Gittenberger, Reinhard Ku...
DAM
2000
126views more  DAM 2000»
13 years 10 months ago
2-Medians in trees with pos/neg weights
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...
Rainer E. Burkard, Eranda Çela, Helidon Dol...
CORR
2011
Springer
159views Education» more  CORR 2011»
13 years 5 months ago
Multicriteria Steiner Tree Problem for Communication Network
Abstract—This paper addresses combinatorial optimization schemes for solving the multicriteria Steiner tree problem for communication network topology design (e.g., wireless mesh...
Mark Sh. Levin, Rustem I. Nuriakhmetov