970 search results - page 58 / 194 » On encodings of spanning trees |
171
click to vote
COMBINATORICA
2008
15 years 6 months ago
2008
The rigidity of squares of graphs in three-space has important applications to the study of flexibility in molecules. The Molecular Conjecture, posed in 1984 by T-S. Tay and W. Wh...
196
click to vote
GAMESEC
2010
15 years 4 months ago
2010
We study the strategic interaction between a network manager whose goal is to choose (as communication infrastructure) a spanning tree of a network given as an undirected graph, an...
182
click to vote
ICALP
2009
Springer
16 years 6 months ago
2009
Springer
We present new results on Cartesian trees with applications in range minimum queries and bottleneck edge queries. We introduce a cache-oblivious Cartesian tree for solving the ran...
162
click to vote
ESANN
2006
15 years 7 months ago
2006
We explore the capability of the Self Organizing Map for structured data (SOM-SD) to compress continuous time data recorded from a kinematic tree, which can represent a robot or an...
171
click to vote
PG
2002
IEEE
15 years 11 months ago
2002
IEEE
We propose a divide and conquer algorithm for the single resolution encoding of triangle mesh connectivity. Starting from a boundary edge we grow a zig-zag strip which divides the...