2487 search results - page 148 / 498 » Partitions of Graphs into Trees |
141
click to vote
TALG
2008
15 years 5 months ago
2008
We present the rst dynamic algorithm that maintains a clique tree representation of a chordal graph and supports the following operations: (1) query whether deleting or inserting ...
158
Voted
COCOA
2008
Springer
15 years 7 months ago
2008
Springer
In a finite simple undirected graph, a vertex is simplicial if its neighborhood is a clique. We say that, for k 2, a graph G = (VG, EG) is the k-simplicial power of a graph H = (V...
144
click to vote
GIS
2009
ACM
16 years 12 days ago
2009
ACM
We propose an automatic approach to tree detection from aerial imagery. First a pixel-level classifier is trained to assign a {tree, non-tree} label to each pixel in an aerial im...
142
click to vote
ESA
2000
Springer
15 years 9 months ago
2000
Springer
We show that a popular variant of the well known k-d tree data structure satisfies an important packing lemma. This variant is a binary spatial partitioning tree T defined on a set...
141
click to vote
ALGORITHMICA
1999
15 years 5 months ago
1999
We discuss an intrinsic generalization of the suffix tree, designed to index a string of length n which has a natural partitioning into m multicharacter substrings or words. This ...