Results 11 to 20 of about 1,675,375 (319)
Tree compression with top trees [PDF]
Information and Computation, 2013 We introduce a new compression scheme for labeled trees based on top trees. Our compression scheme is the first to simultaneously take advantage of internal repeats in the tree (as opposed to the classical DAG compression that only exploits rooted subtree repeats) while also supporting fast navigational queries directly on the compressed representation.
Philip Bille +3 more
openaire +3 more sources
A suffix tree or not a suffix tree? [PDF]
Journal of Discrete Algorithms, 2015 Full version.
Starikovskaya, Tatiana A. +1 more
openaire +3 more sources
, 2022 Search trees on trees (STTs) are a far-reaching generalization of binary search trees (BSTs), allowing the efficient exploration of tree-structured domains. (BSTs are the special case in which the underlying domain is a path.) Trees on trees have been extensively studied under various guises in computer science and discrete mathematics.
Benjamin Aram Berendsohn +1 more
openaire +2 more sources
Canonical trees of tree-decompositions [PDF]
Journal of Combinatorial Theory, Series B, 2022 22 ...
Johannes Carmesin +2 more
openaire +2 more sources
Pairs of trees in tree–tree triangulations
Discrete Mathematics, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Günter Schaar, Zdzislaw Skupien
openaire +2 more sources
Trees with Distinguishing Index Equal Distinguishing Number Plus One
Discussiones Mathematicae Graph Theory, 2020 The distinguishing number (index) D(G) (D′ (G)) of a graph G is the least integer d such that G has an vertex (edge) labeling with d labels that is preserved only by the trivial automorphism.
Alikhani Saeid +3 more
doaj +1 more source
Vojnotehnički Glasnik, 2015 Antropogeni i tehnogeni uticaj na životnu sredinu pojačan je u poslednjoj deceniji XX veka. Taj trend se nastavlja i u XXI veku, a ofanziva globalizacije donosi nove ekološke probleme. Globalni ekološki problemi najviše pogađaju gradove.
Miloš Z. Petrović +2 more
doaj +1 more source
Singing Trees. Note su Tōru Takemitsu
Rivista di Estetica, 2022 The article examines the relationship between Western and Eastern aesthetics, analyzing some aspects of the musical production of Tōru Takemitsu, the great Japanese composer, now firmly included in the contemporary music “Western Canon”.
Pier Alberto, Porceddu Cilione
doaj +1 more source
Fast approximation of search trees on trees with centroid trees
CoRR, 2022 Search trees on trees (STTs) generalize the fundamental binary search tree (BST) data structure: in STTs the underlying search space is an arbitrary tree, whereas in BSTs it is a path. An optimal BST of size $n$ can be computed for a given distribution of queries in $O(n^2)$ time [Knuth 1971] and centroid BSTs provide a nearly-optimal alternative ...
Berendsohn, Benjamin Aram +3 more
openaire +4 more sources
Colourings of (k-r,k)-trees [PDF]
Opuscula Mathematica, 2017 Trees are generalized to a special kind of higher dimensional complexes known as \((j,k)\)-trees ([L. W. Beineke, R. E. Pippert, On the structure of \((m,n)\)-trees, Proc. 8th S-E Conf. Combinatorics, Graph Theory and Computing, 1977, 75-80]), and which
M. Borowiecki, H. P. Patil
doaj +1 more source