1199 search results - page 102 / 240 » Graph Theory |
138
click to vote
COMPGEOM
2006
ACM
15 years 10 months ago
2006
ACM
Embedding metrics into constant-dimensional geometric spaces, such as the Euclidean plane, is relatively poorly understood. Motivated by applications in visualization, ad-hoc netw...
117
click to vote
KDD
2005
ACM
16 years 4 months ago
2005
ACM
We present an algorithm for mining tree-shaped patterns in a large graph. Novel about our class of patterns is that they can contain constants, and can contain existential nodes w...
154
click to vote
TALG
2008
15 years 3 months ago
2008
A graph G is the k-leaf power of a tree T if its vertices are leaves of T such that two vertices are adjacent in G if and only if their distance in T is at most k. Then T is a k-le...
109
click to vote
ENTCS
2007
15 years 4 months ago
2007
We tackle the problem of data-structure rewriting including global and local pointer redirections. Each basic rewrite step may perform three kinds of actions: (i) Local redirectio...
140
click to vote
SCIA
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. This paper introduces a new concept within shadow segmentation for usage in shadow removal and augmentation through construction of a multiplicity alpha overlay shadow mo...