Undirected st-connectivity is important both for its applications in
net...
We study an elementary Markov process on graphs based on electric flow
s...
We describe a simple algorithm for estimating the k-th normalized Betti
...
Hamiltonian Monte Carlo (HMC) is a Markov chain algorithm for sampling f...
We study the complexity of determining the edge connectivity of a simple...
Continuous-time quantum walks provide a natural framework to tackle the
...
In a breakthrough work, Kawarabayashi and Thorup (J. ACM'19) gave a
near...
An s-t minimum cut in a graph corresponds to a minimum
weight subset of ...
In graph property testing the task is to distinguish whether a graph
sat...
The edge connectivity of a simple graph is the least number of edges who...
The main results on quantum walk search are scattered over different,
in...
Graph sparsification underlies a large number of algorithms, ranging fro...
Expansion testing aims to decide whether an n-node graph has expansion a...
This work describes a new algorithm for creating a superposition over th...
Isoperimetric inequalities form a very intuitive yet powerful
characteri...