%0 Conference Paper %1 conf/soda/KijimaSS21 %A Kijima, Shuji %A Shimizu, Nobutaka %A Shiraga, Takeharu %B SODA %D 2021 %E Marx, Dániel %I SIAM %K dblp %P 106-122 %T How Many Vertices Does a Random Walk Miss in a Network with Moderately Increasing the Number of Vertices? %U http://dblp.uni-trier.de/db/conf/soda/soda2021.html#KijimaSS21 %@ 978-1-61197-646-5

@inproceedings{conf/soda/KijimaSS21, added-at = {2023-09-30T00:00:00.000+0200}, author = {Kijima, Shuji and Shimizu, Nobutaka and Shiraga, Takeharu}, biburl = {https://www.bibsonomy.org/bibtex/28acbe405173f15f1ff058418c6436ed3/dblp}, booktitle = {SODA}, crossref = {conf/soda/2021}, editor = {Marx, Dániel}, ee = {https://doi.org/10.1137/1.9781611976465.8}, interhash = {0020d1b1da417cbc72506733d7bb5ed7}, intrahash = {8acbe405173f15f1ff058418c6436ed3}, isbn = {978-1-61197-646-5}, keywords = {dblp}, pages = {106-122}, publisher = {SIAM}, timestamp = {2024-04-09T11:22:04.000+0200}, title = {How Many Vertices Does a Random Walk Miss in a Network with Moderately Increasing the Number of Vertices?}, url = {http://dblp.uni-trier.de/db/conf/soda/soda2021.html#KijimaSS21}, year = 2021 }