Пожалуйста, войдите в систему, чтобы принять участие в дискуссии (добавить собственные рецензию, или комментарий)
Цитировать эту публикацию
%0 Journal Article
%1 journals/corr/FleszarMS16
%A Fleszar, Krzysztof
%A Mnich, Matthias
%A Spoerhase, Joachim
%D 2016
%J CoRR
%K
%T New Algorithms for Maximum Disjoint Paths Based on Tree-Likeness.
%U http://dblp.uni-trier.de/db/journals/corr/corr1603.html#FleszarMS16
%V abs/1603.01740
@article{journals/corr/FleszarMS16,
added-at = {2023-12-12T19:30:20.000+0100},
author = {Fleszar, Krzysztof and Mnich, Matthias and Spoerhase, Joachim},
biburl = {https://www.bibsonomy.org/bibtex/24a43eef6d4758787efd8aa51be008ba3/admin},
ee = {http://arxiv.org/abs/1603.01740},
interhash = {21bb734babf190f41f2736a188e8dc26},
intrahash = {4a43eef6d4758787efd8aa51be008ba3},
journal = {CoRR},
keywords = {},
timestamp = {2023-12-12T19:30:20.000+0100},
title = {New Algorithms for Maximum Disjoint Paths Based on Tree-Likeness.},
url = {http://dblp.uni-trier.de/db/journals/corr/corr1603.html#FleszarMS16},
volume = {abs/1603.01740},
year = 2016
}