75 search results - page 3 / 15 » Time Warp -- Connection Oriented |
EJC
2011
13 years 3 months ago
2011
We present an algorithm which takes a graph as input and decides in cubic time if the graph is the cocircuit graph of a uniform oriented matroid. In the affirmative case the algor...
ICMCS
1994
IEEE
14 years 21 days ago
1994
IEEE
Abstract
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...
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...
GRAPHICSINTERFACE
2004
13 years 10 months ago
2004
In this paper we present a fast and robust approach for simulating elasto-plastic materials and fracture in real time. Our method extends the warped stiffness finite element appro...