English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Conference Paper

Density Independent Algorithms for Sparsifying k-Step Random Walks

MPS-Authors
/persons/resource/persons136381

Kolev,  Pavel
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

http://drops.dagstuhl.de/opus/volltexte/2017/7563/
(Publisher version)

http://drops.dagstuhl.de/doku/urheberrecht1.html
(Copyright transfer agreement)

Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Jindal, G., Kolev, P., Peng, R., & Sawlani, S. (2017). Density Independent Algorithms for Sparsifying k-Step Random Walks. In K. Jansen, J. D. P. Rolim, D. P. Williamson, & S. S. Vempala (Eds.), Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (pp. 1-17). Wadern: Schloss Dagstuhl. doi:10.4230/LIPIcs.APPROX-RANDOM.2017.14.


Cite as: https://hdl.handle.net/21.11116/0000-0002-A92E-D
Abstract
There is no abstract available