Given a 2k-edge-connected undirected graph, we consider to find a minimum cost orientation that yields a k-arc-connected directed graph. This minimum cost k-arc-connected orientat...
The state of the art in verifying the real-time requirements of applications developed using general processing graph models relies on simulation or off-line scheduling. We extend...
Abstract. We propose a generic framework and methods for simplification of large networks. The methods can be used to improve the understandability of a given network, to complemen...
We present the first polynomial-time approximation schemes (PTASes) for the following subset-connectivity problems in edge-weighted graphs of bounded genus: Steiner tree, low-conn...
Glencora Borradaile, Erik D. Demaine, Siamak Tazar...
— In this paper a novel formalism to characterize contact states between an articulated polyhedral object and a polyhedral environment for the generation of the graph of feasible...