446 search results - page 29 / 90 » A fast algorithm for computing steiner edge connectivity |
179
click to vote
TPDS
2010
15 years 4 months ago
2010
Abstract—We propose an algorithm that provides for deadlockfree and livelock-free routing, in particular in wormhole routed networks. The proposed algorithm requires nearly minim...
175
click to vote
GD
2000
Springer
15 years 9 months ago
2000
Springer
We present a multi-scale layout algorithm for the aesthetic drawing of undirected graphs with straight-line edges. The algorithm is extremely fast, and is capable of drawing graph...
199
click to vote
ICCV
2009
IEEE
16 years 10 months ago
2009
IEEE
We present a new algorithm for a robust family of Earth Mover’s Distances - EMDs with thresholded ground distances. The algorithm transforms the flow-network of the EMD so that t...
190
click to vote
SOFSEM
2007
Springer
16 years 1 hour ago
2007
Springer
In this paper we deal with making drawings of clustered hierarchical graphs nicer. Given a planar graph G = (V, E) with an assignment of the vertices to horizontal layers, a plane ...
147
click to vote
TCS
2010
15 years 18 days ago
2010
Abstract. A trivalent diagram is a connected, two-colored bipartite graph (parallel edges allowed but not loops) such that every black vertex is of degree 1 or 3 and every white ve...