Пожалуйста, войдите в систему, чтобы принять участие в дискуссии (добавить собственные рецензию, или комментарий)
Цитировать эту публикацию
%0 Journal Article
%1 journals/algorithmica/TaubigWKHM13
%A Täubig, Hanjo
%A Weihmann, Jeremias
%A Kosub, Sven
%A Hemmecke, Raymond
%A Mayr, Ernst W.
%D 2013
%J Algorithmica
%K dblp
%N 4
%P 804-828
%T Inequalities for the Number of Walks in Graphs.
%U http://dblp.uni-trier.de/db/journals/algorithmica/algorithmica66.html#TaubigWKHM13
%V 66
@article{journals/algorithmica/TaubigWKHM13,
added-at = {2019-09-16T00:00:00.000+0200},
author = {Täubig, Hanjo and Weihmann, Jeremias and Kosub, Sven and Hemmecke, Raymond and Mayr, Ernst W.},
biburl = {https://www.bibsonomy.org/bibtex/22bc73aa3e928f98197d7a209cc0d0cf2/dblp},
ee = {https://doi.org/10.1007/s00453-013-9766-3},
interhash = {fed7f398fd6a864dfabeb1c9ce041ea4},
intrahash = {2bc73aa3e928f98197d7a209cc0d0cf2},
journal = {Algorithmica},
keywords = {dblp},
number = 4,
pages = {804-828},
timestamp = {2019-09-17T11:50:46.000+0200},
title = {Inequalities for the Number of Walks in Graphs.},
url = {http://dblp.uni-trier.de/db/journals/algorithmica/algorithmica66.html#TaubigWKHM13},
volume = 66,
year = 2013
}