Iterative cutting and pruning of planar trees

DOI10.1137/1.9781611974775.6MaRDI QIDQ5195036zbMATH OpenOpenAlexFDO

Authors Benjamin Hackl, Sara Kropf, Helmut Prodinger

Publication date 17 September 2019

Published in 2017 Proceedings of the Fourteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1.9781611974775.6

zbMATH Keywords

pruning a treerooted plane trees

Mathematics Subject Classification ID

Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph operations (line graphs, products, etc.) (05C76)

Recommendations

• Fringe analysis of plane trees related to cutting and pruning
• Reducing simply generated trees by iterative leaf cutting
• Isolating a leaf in rooted trees via random cuttings
• Cuts in increasing trees
• Random cutting and records in deterministic and random trees

Cited in

(9)

• Pruning by isomorphism in branch-and-cut
• Dynamical pruning of rooted trees with applications to 1-D ballistic annihilation
• Pruning of CRT-sub-trees
• Fringe analysis of plane trees related to cutting and pruning
• How to Use Planarity Efficiently: New Tree-Decomposition Based Algorithms
• scientific article; zbMATH DE number 1757963 (Why is no real title available?)
• Reducing simply generated trees by iterative leaf cutting
• Pruned discrete random samples
• Slicing tree's geometric potential: an indicator for layout problems based on slicing tree structure

This page was built for publication: Iterative cutting and pruning of planar trees

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