pdfformat: 

@InProceedings{jindal_et_al:LIPIcs:2017:7563, author = {Gorav Jindal and Pavel Kolev and Richard Peng and Saurabh Sawlani}, title = {{Density Independent Algorithms for Sparsifying kStep Random Walks}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2017)}, pages = {14:114:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959770446}, ISSN = {18688969}, year = {2017}, volume = {81}, editor = {Klaus Jansen and Jos{\'e} D. P. Rolim and David Williamson and Santosh S. Vempala}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2017/7563}, URN = {urn:nbn:de:0030drops75638}, doi = {10.4230/LIPIcs.APPROXRANDOM.2017.14}, annote = {Keywords: random walks, graph sparsification, spectral graph theory, effective resistances} }
Keywords:  random walks, graph sparsification, spectral graph theory, effective resistances  
Seminar:  Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2017)  
Issue date:  2017  
Date of publication:  2017 