5100 search results - page 62 / 1020 » The Linear Complexity of a Graph |
RT
1999
Springer
14 years 4 days ago
1999
Springer
A visibility algorithm for triangulated panoramas is proposed. The algorithm can correctly resolve the visibility without making use of any depth information. It is especially usef...
TAGT
1994
Springer
13 years 12 months ago
1994
Springer
An operation of concatenation is introduced for graphs. Then strings are viewed as expressions denoting graphs, and string languages are interpreted as graph languages. For a clas...
DAM
2008
13 years 8 months ago
2008
For each constant k, we present a linear time algorithm that, given a planar graph G, either finds a minimum odd cycle vertex transversal in G or guarantees that there is no transv...
IPCO
2008
13 years 9 months ago
2008
Abstract. Semidefinite relaxations are known to deliver good approximations for combinatorial optimization problems like graph bisection. Using the spectral bundle method it is pos...
ACCV
2010
Springer
13 years 2 months ago
2010
Springer
The Viewing Graph [1] represents several views linked by the corresponding fundamental matrices, estimated pairwise. Given a Viewing Graph, the tuples of consistent camera matrices...