In this paper, we survey fully dynamic algorithms for path problems on general directed graphs. In particular, we consider two fundamental problems: dynamic transitive closure and...
In this paper we investigate how certain results related to the HananiTutte theorem can be extended from the plane to surfaces. We give a simple topological proof that the weak Ha...
Michael J. Pelsmajer, Marcus Schaefer, Daniel Stef...
Abstract—We present a unified graphical model framework for describing compound codes and deriving iterative decoding algorithms. After reviewing a variety of graphical models (...
Let X be a set of points in general position in the plane. General position means that no three points lie on a line and no two points have the same x-coordinate. Y X is a cup, r...
This paper presents a very general, exact technique for scheduling looping data-flow graphs. In contrast to the conventional technique using loop iteration variables and integer ...