3 citations · 7 across the 8 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2021
Rapid mixing for the hardcore Glauber dynamics and other Markov chains in bounded-treewidth graphs
David Eppstein, Daniel Frishberg
We give a new rapid mixing result for a natural random walk on the independent sets of a graph . We show that when has bounded treewidth, this random walk -- known as the Gl…
cs.DS2020
Simplifying Activity-on-Edge Graphs
David Eppstein, Daniel Frishberg, Elham Havvaei
We formalize the simplification of activity-on-edge graphs used for visualizing project schedules, where the vertices of the graphs represent project milestones, and the edges repr…