4201 search results - page 204 / 841 » Interaction graphs: Additives |
147
click to vote
ICALP
2010
Springer
15 years 9 months ago
2010
Springer
We present an O(m + n)-time algorithm that tests if a given directed graph is 2-vertex connected, where m is the number of arcs and n is the number of vertices. Based on this resul...
155
click to vote
JACM
2000
15 years 6 months ago
2000
A deterministic algorithm for computing a minimum spanning tree of a connected graph is presented. Its running time is O(m (m, n)), where is the classical functional inverse of Ack...
204
click to vote
WINE
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We present a new technique for analyzing the rate of convergence of local dynamics in bargaining networks. The technique reduces balancing in a bargaining network to opti...
169
click to vote
ICIP
2008
IEEE
16 years 7 months ago
2008
IEEE
Video streaming with virtual pan/tilt/zoom functionality allows the viewer to watch arbitrary regions of a high-spatial-resolution scene. In our proposed system, the user controls...
152
click to vote
VIS
2006
IEEE
16 years 7 months ago
2006
IEEE
Volume rendered imagery often includes a barrage of 3D information like shape, appearance and topology of complex structures, and it thus quickly overwhelms the user. In particular...