![]() |
@article{DBLP:journals/networks/Pippenger99,
author = {Nicholas Pippenger},
title = {Upper and lower bounds for the average-case complexity of
path-search},
journal = {Networks},
volume = {33},
number = {4},
year = {1999},
pages = {249-259},
ee = {http://dx.doi.org/10.1002/(SICI)1097-0037(199907)33:4$<$249::AID-NET2$>$3.0.CO;2-7},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Copyright © 2003-07-02 by Michael Ley (ley@uni-trier.de)