Combinatorial Network Abstraction by Trees and Distances release_fwcv3uowxvbddpux53rm57pibq

by Stefan Eckhardt, Sven Kosub, Moritz G. Maaß, Hanjo Täubig, Sebastian Wernicke

Published in Lecture Notes in Computer Science by Springer Berlin Heidelberg.

2005   p1100-1109

Archived Files and Locations

application/pdf  1.5 MB
file_6f7vyik4nffsfpd2c4grsblyiy
theinf1.informatik.uni-jena.de (web)
web.archive.org (webarchive)
application/pdf  294.3 kB
file_lul477gmz5ay5kluhhnurnpmme
mediatum.ub.tum.de (web)
web.archive.org (webarchive)
web.archive.org (webarchive)
wwwmayr.in.tum.de (web)
application/pdf  205.4 kB
file_tbtzmgdg6vgoxhrzxny2qvjvvq
theinf1.informatik.uni-jena.de (web)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  chapter
Stage   published
Year   2005
Container Metadata
Not in DOAJ
Not in Keepers Registry
ISSN-L:  0302-9743
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 5544fc2d-2464-4531-9462-4e09b2e3ac6e
API URL: JSON