A decomposition algorithm for noncrossing trees

MaRDI QIDQ405065zbMATHFDO

Authors Lun Lv, Sabrina X. M. Pang

Publication date 4 September 2014

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL http://www.combinatorics.org/ojs/index.php/eljc/article/view/v21i1p5

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

descentbijectionnoncrossing tree

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30)

Recommendations

• Decomposition and merging algorithms for noncrossing forests
• Descents in noncrossing trees
• Noncrossing trees and noncrossing graphs
• Statistics on non-crossing trees
• Locally oriented noncrossing trees

Cites work

• scientific article; zbMATH DE number 6683596 (Why is no real title available?)
• scientific article; zbMATH DE number 1268810 (Why is no real title available?)
• A general bijective algorithm for trees.
• Analytic combinatorics of non-crossing configurations
• Bijections for ternary trees and non-crossing trees
• Consecutive pattern avoidances in non-crossing trees
• Descents in noncrossing trees
• Dyck path enumeration
• Dyck paths with coloured ascents
• Enumeration of noncrossing trees on a circle
• Noncrossing trees and noncrossing graphs
• Statistics on non-crossing trees
• The cyclic sieving phenomenon for non-crossing forests

Cited in

(6)

• Decomposition and merging algorithms for noncrossing forests
• Descents in noncrossing trees
• Noncrossing trees and noncrossing graphs
• A general bijective algorithm for increasing trees
• Parameterized algorithms for non-separating trees and branchings in digraphs
• An Iterative Heuristic Algorithm for Tree Decomposition

This page was built for publication: A decomposition algorithm for noncrossing trees

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