3396 search results - page 44 / 680 » Tree representations of graphs |
109
Voted
CPM
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. k-ary trees are a fundamental data structure in many textprocessing algorithms (e.g., text searching). The traditional pointer-based representation of trees is space cons...
94
Voted
ALT
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. We consider the problem of learning stochastic tree languages, i.e. probability distributions over a set of trees T(F), from a sample of trees independently drawn accordi...
93
Voted
ARSCOM
2005
15 years 14 days ago
2005
We investigate the supereulerian graph problems within planar graphs, and we prove that if a 2-edge-connected planar graph G is at most three edges short of having two edge-disjoi...
88
Voted
SMA
2003
ACM
15 years 5 months ago
2003
ACM
This paper presents a new method to compute constructive solid geometry (CSG) tree representations of an object whose faces consist of planar and non-planar surfaces. The algorith...
CPM
2008
Springer
15 years 2 months ago
2008
Springer
Let G be an unweighted and undirected graph of n nodes, and let D be the n