491 search results - page 37 / 99 » On cyclically orientable graphs |
ALGORITHMICA
2010
13 years 8 months ago
2010
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...
HASE
1999
IEEE
14 years 24 days ago
1999
IEEE
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...
IDA
2010
Springer
13 years 10 months ago
2010
Springer
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...
STACS
2009
Springer
14 years 3 months ago
2009
Springer
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...
ICRA
2005
IEEE
14 years 2 months ago
2005
IEEE
— 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...