Stefan Eckhardt, Sven Kosub, Moritz G. Maaß, Hanjo Täubig, Sebastian Wernicke. Combinatorial Network Abstraction by Trees and Distances. In Xiaotie Deng, Ding-Zhu Du, editors, Algorithms and Computation, 16th International Symposium, ISAAC 2005, Sanya, Hainan, China, December 19-21, 2005, Proceedings. Volume 3827 of Lecture Notes in Computer Science, pages 1100-1109, Springer, 2005. [doi]
@inproceedings{EckhardtKMTW05,
title = {Combinatorial Network Abstraction by Trees and Distances},
author = {Stefan Eckhardt and Sven Kosub and Moritz G. Maaß and Hanjo Täubig and Sebastian Wernicke},
year = {2005},
doi = {10.1007/11602613_109},
url = {http://dx.doi.org/10.1007/11602613_109},
tags = {abstraction},
researchr = {https://researchr.org/publication/EckhardtKMTW05},
cites = {0},
citedby = {0},
pages = {1100-1109},
booktitle = {Algorithms and Computation, 16th International Symposium, ISAAC 2005, Sanya, Hainan, China, December 19-21, 2005, Proceedings},
editor = {Xiaotie Deng and Ding-Zhu Du},
volume = {3827},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-30935-7},
}