1370 search results - page 92 / 274 » On grids in topological graphs |
164
click to vote
IH
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. This paper presents an implementation of the novel watermarking method proposed by Venkatesan, Vazirani, and Sinha in their recent paper A Graph Theoretic Approach to Sof...
174
click to vote
CPC
2006
15 years 6 months ago
2006
The adaption of combinatorial duality to infinite graphs has been hampered by the fact that while cuts (or cocycles) can be infinite, cycles are finite. We show that these obstruc...
186
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...
170
click to vote
ISMM
2009
Springer
16 years 25 days ago
2009
Springer
Abstract. We study hierachical segmentation in the framework of edgeweighted graphs. We define ultrametric watersheds as topological watersheds null on the minima. We prove that t...
168
click to vote
IWOCA
2009
Springer
16 years 25 days ago
2009
Springer
A circuit in a simple undirected graph G = (V, E) is a sequence of vertices {v1, v2, . . . , vk+1} such that v1 = vk+1 and {vi, vi+i} ∈ E for i = 1, . . . , k. A circuit C is sai...