Abstract. Graphs are an intuitive model for states of a (software) system that include pointer structures — for instance, object-oriented programs. However, a naive encoding resu...
Kernelization algorithms are polynomial-time reductions from a problem to itself that guarantee their output to have a size not exceeding some bound. For example, d-Set Matching f...
We study several variants of coordinated consensus in dynamic networks. We assume a synchronous model, where the communication graph for each round is chosen by a worst-case adver...
We consider the reachability problem for a certain class of directed acyclic graphs embedded on surfaces. Let G(m, g) be the class of directed acyclic graphs with m = m(n) source ...
Many emerging large-scale data science applications require searching large graphs distributed across multiple memories and processors. This paper presents a distributed breadthï¬...
Andy Yoo, Edmond Chow, Keith W. Henderson, Will Mc...