We investigate the s-t-connectivity problem for directed planar graphs, which is hard for L and is contained in NL but is not known to be complete. We show that this problem is log...
Abstract-We study the well known linear consensus algorithm by means of a LQ-type performance cost. We want to understand how the communication topology influences this algorithm. ...
—This paper focuses on the Internet IP-level routing topology and proposes relevant explanations to its apparent dynamics. We first represent this topology as a power-law random...
We present a new downsampling method for structured volume grids, which preserves much more of the topology of a scalar field than existing downsampling methods by preferably selec...
Research on mobile robot navigation has produced two major paradigms for mapping indoorenvironments: grid-based and topological. While grid-based methods produce accurate metric m...