171 search results - page 18 / 35 » Algorithms for Single-Source Vertex Connectivity |
95
Voted
DMTCS
2010
14 years 6 months ago
2010
Motivated by the bijection between Schnyder labelings of a plane triangulation and partitions of its inner edges into three trees, we look for binary labelings for quadrangulation...
GLOBECOM
2007
IEEE
15 years 3 months ago
2007
IEEE
— An opportunistic large array (OLA) is a form of cooperative diversity in which a large group of simple, inexpensive relays or forwarding nodes operate without any mutual coordi...
99
Voted
JODS
2006
14 years 9 months ago
2006
While providing a uniform syntax and a semistructured data model, XML does not express semantics but only structure such as nesting information. In this paper, we consider the prob...
63
Voted
STOC
1993
ACM
15 years 1 months ago
1993
ACM
We consider a class of routing problems on connected graphs G. Initially, each vertex v of G is occupied by a “pebble” which has a unique destination π(v) in G (so that π is...
109
click to vote
ECCV
2006
Springer
15 years 11 months ago
2006
Springer
Many traditional stereo correspondence methods emphasized on utilizing epipolar constraint and ignored the information embedded in inter-epipolar lines. Actually some researchers h...