algorithms-optimization / Randomized algorithms
Sampling a nearly uniform Eulerian tour of a directed Eulerian multigraph was stuck at $mn$-type running times coming from arborescence sampling. A randomized algorithm achieves $\widetilde{O}(m^{3/2})$ worst case, breaking that barrier on sparse graphs.
Temporal state
No reconciled state yet.
Append-only history
Sampling a nearly uniform Eulerian tour of a directed Eulerian multigraph was stuck at $mn$-type running times coming from arborescence sampling. A randomized algorithm achieves $\widetilde{O}(m^{3/2})$ worst case, breaking that barrier on sparse graphs.
Research memory
Sampling a nearly uniform Eulerian tour of a directed Eulerian multigraph was stuck at $mn$-type running times coming from arborescence sampling. A randomized algorithm achieves $\widetilde{O}(m^{3/2})$ worst case, breaking that barrier on sparse graphs.
Evidence graph
No public relationships recorded yet.