An improved kernel size for rotation distance in binary trees (Q763531): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: General Balanced Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for estimating rotation distance between two binary trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex Cover: Further Observations and Further Improvements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rotation distance is fixed-parameter tractable / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on some tree similarity measures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Lost Continent of Polynomial Time: Preprocessing and Kernelization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph of triangulations of a convex polygon and tree of triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relaxed balance using standard rotations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The rotation graph of binary trees is Hamiltonian / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Rotations and the Generation of Binary Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the upper bound on the rotation distance of binary trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short notes: Some Properties of the Rotation Lattice of Binary Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3838181 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393275 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating binary trees by transpositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-adjusting binary search trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rotation Distance, Triangulations, and Hyperbolic Geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating binary trees using rotations / rank
 
Normal rank

Revision as of 23:22, 4 July 2024

scientific article
Language Label Description Also known as
English
An improved kernel size for rotation distance in binary trees
scientific article

    Statements

    An improved kernel size for rotation distance in binary trees (English)
    0 references
    0 references
    12 March 2012
    0 references
    combinatorial problems
    0 references
    fixed-parameter tractability
    0 references
    rotation distance
    0 references

    Identifiers