On the Complexity of Sampling Vertices Uniformly from a Graph

Summary

This is a publication. If there is no link to the publication on this page, you can try the pre-formated search via the search engines listed on this page.

Authors: Flavio Chierichetti, Shahrzad Haddadan

Journal title: Proceedings of 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)

Journal number: 2018

Journal publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik

Published year: 2018

DOI identifier: 10.4230/LIPIcs.ICALP.2018.149