Results 11 to 20 of about 3,867,667 (297)
Proceedings of the International Working Conference on Advanced Visual Interfaces, 2016 We introduce Flexible Trees, a sketch-based layout adjustment technique. Although numerous tree layout algorithms exist, these algorithms are usually bound to fit within standard shapes such as rectangles, circles and triangles. In order to provide the possibility of interactively customizing a tree layout, we offer a free-form sketch-based interaction
Sadeghi, Javad +4 more
openaire +3 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
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.
Bille, Philip +3 more
openaire +4 more sources
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
Hash Trees Versus B-Trees [PDF]
The Computer Journal, 1984 Summary: The hash trees method of external hashing is known to have advantages for certain types of primary key distribution. In this paper the value of the method as a general indexing technique - for secondary keys as well as primary keys - is assessed, and comparison with the B-trees method is presented.
Bell, D. A., Deen, S. M.
openaire +1 more source
Efficient Tree Tensor Network States (TTNS) for Quantum Chemistry: Generalizations of the Density Matrix Renormalization Group Algorithm [PDF]
, 2013 We investigate tree tensor network states for quantum chemistry. Tree tensor network states represent one of the simplest generalizations of matrix product states and the density matrix renormalization group.
Chan, Garnet Kin-Lic, Nakatani, Naoki
core +2 more sources
Pairs of trees in tree–tree triangulations
Discrete Mathematics, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Schaar, Günter, Skupień, Zdzisław
openaire +2 more sources
, 2011 After stating several tools which can be used to construct indecomposable tree modules for quivers without oriented cycles, we use these methods to construct indecomposable tree modules for every imaginary Schur root. These methods also give a recipe for
Fachbereich C Mathematik, Thorsten Weist
core +1 more source
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