Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

63

Voted

ISAAC
2005
Springer

88views Algorithms» more ISAAC 2005»

Combinatorial Network Abstraction by Trees and Distances

15 years 8 months ago

Combinatorial Network Abstraction by Trees and Distances

Download theinf1.informatik.uni-jena.de

Stefan Eckhardt, Sven Kosub, Moritz G. Maaß,

Real-time Traffic

ISAAC 2005 |

claim paper

Related Content

» Cerebral Vascular Tree Matching of 3DRA Data Based on Tree Edit Distance

» Combinatorial Models for Cooperation Networks

» 2Medians in trees with posneg weights

» Multicriteria Steiner Tree Problem for Communication Network

» A combinatorial algorithm for weighted stable sets in bipartite graphs

» Comparison of TreeChild Phylogenetic Networks

» Reconstructing an Ultrametric Galled Phylogenetic Network from a Distance Matrix

» Variable Neighborhood Search and Ant Colony Optimization for the Rooted DelayConstrained M...

» A novel unsupervised classification approach for network anomaly detection by kMeans clust...

Post Info
More Details (n/a)

Added	27 Jun 2010
Updated	27 Jun 2010
Type	Conference
Year	2005
Where	ISAAC
Authors	Stefan Eckhardt, Sven Kosub, Moritz G. Maaß, Hanjo Täubig, Sebastian Wernicke

Comments (0)