On bounds for the rotation distance between binary coupling trees

MaRDI QIDQ2741329zbMATH OpenFDO

Authors S. Lievens, V. Fack, J 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

Mathematics Subject Classification ID

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

Recommendations

• On the diameter of the rotation graph of binary coupling trees
• On the rotation distance of graphs
• scientific article; zbMATH DE number 1161281
• Rotation Distance, Triangulations, and Hyperbolic Geometry
• Lower bounds on the rotation distance of binary trees

Cites work

• A computationally efficient approximation to the nearest neighbor interchange metric
• A note on some tree similarity measures
• Approximating minimum-length-sequence metrics: A cautionary note
• Calculation of general recoupling coefficients using graphical methods
• Computing the nearest neighbor interchange metric for unlabeled binary trees is NP-complete
• Counterexamples in measuring the distance between binary trees
• Counting dendrograms: A survey
• scientific article; zbMATH DE number 3130885 (Why is no real title available?)
• scientific article; zbMATH DE number 3180958 (Why is no real title available?)
• scientific article; zbMATH DE number 3743204 (Why is no real title available?)
• scientific article; zbMATH DE number 47235 (Why is no real title available?)
• scientific article; zbMATH DE number 1161281 (Why is no real title available?)
• scientific article; zbMATH DE number 194437 (Why is no real title available?)
• scientific article; zbMATH DE number 3432667 (Why is no real title available?)
• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• 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 diameter of the rotation graph of binary coupling trees
• On the upper bound on the rotation distance of binary trees
• Optimal algorithms for comparing trees with labeled leaves
• Rotation Distance, Triangulations, and Hyperbolic Geometry
• Short Encodings of Evolving Structures
• The On-Line Encyclopedia of Integer Sequences

Cited in

(3)

• On the diameter of the rotation graph of binary coupling trees
• Realizations of coupled vectors in the tensor product of representations of \(\mathfrak{su}(1,1)\) and \(\mathfrak{su}(2)\)
• scientific article; zbMATH DE number 58304 (Why is no real title available?)

Describes a project that uses

Uses Software

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

This page was built for publication: On bounds for the rotation distance between binary coupling trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2741329)