2. THE MASM ALGORITHM An input to the MASM algorithm is a time-annotated multi-agent action sequence. The action sequence is then transformed into an action graph. An action graph ...
We consider online routing algorithms for finding paths between the vertices of plane graphs. We show (1) there exists a routing algorithm for arbitrary triangulations that has no...
Prosenjit Bose, Pat Morin, Andrej Brodnik, Svante ...
In this paper we study some connectivity augmentation problems. Given a connected graph G with some desirable property, we want to make G 2-vertex connected (or 2-edge connected) ...
SAT sweeping is a method for simplifying an AND/INVERTER graph (AIG) by systematically merging graph vertices from the inputs towards the outputs using a combination of structural...
Qi Zhu, Nathan Kitchen, Andreas Kuehlmann, Alberto...
Let T be a spanning tree of a graph G and S V (G) be a set of sources. The routing cost of T is the total distance from all sources to all vertices. For an edge e of T, the swap ...