scientific article

zbMath1039.05515MaRDI QIDQ2741329

Stijn Lievens, Veerle Fack, Joris Van der Jeugt

Publication date: 23 September 2001

Full work available at URL: http://www.elsevier.nl/cas/tree/store/disc/free/endm/store/contents.htt?jrnl=disc&sctn=endm&mode=sub&vol=3

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35)

Related Items

Realizations of coupled vectors in the tensor product of representations of \(\mathfrak{su}(1,1)\) and \(\mathfrak{su}(2)\)

Uses Software

• OEIS
• NJFORMULA
• NEWGRAPH
• NJGRAF
• NJSUMMATION
• NJSUMPAR

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Counting dendrograms: A survey
• Approximating minimum-length-sequence metrics: A cautionary note
• Counterexamples in measuring the distance between binary trees
• A computationally efficient approximation to the nearest neighbor interchange metric
• Optimal algorithms for comparing trees with labeled leaves
• Computing the nearest neighbor interchange metric for unlabeled binary trees is NP-complete
• A note on some tree similarity measures
• Calculation of general recoupling coefficients using graphical methods
• On the diameter of the rotation graph of binary coupling trees
• New efficient programs to calculate general recoupling coefficients. I: Generation of a summation formula
• New efficient programs to calculate general recoupling coefficients. II: Evaluation of a summation formula
• On the upper bound on the rotation distance of binary trees
• Rotation Distance, Triangulations, and Hyperbolic Geometry
• Short Encodings of Evolving Structures