A decomposition algorithm for noncrossing trees
zbMATH Open1300.05302MaRDI QIDQ405065FDOQ405065
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
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30)
Cites Work
- Title not available (Why is that?)
- Analytic combinatorics of non-crossing configurations
- Dyck path enumeration
- Enumeration of noncrossing trees on a circle
- A general bijective algorithm for trees.
- The cyclic sieving phenomenon for non-crossing forests
- Descents in noncrossing trees
- Bijections for ternary trees and non-crossing trees
- Statistics on non-crossing trees
- Noncrossing trees and noncrossing graphs
- Title not available (Why is that?)
- Consecutive pattern avoidances in non-crossing trees
- Dyck paths with coloured ascents
Cited In (6)
- Descents in noncrossing trees
- Parameterized algorithms for non-separating trees and branchings in digraphs
- Noncrossing trees and noncrossing graphs
- Decomposition and merging algorithms for noncrossing forests
- An Iterative Heuristic Algorithm for Tree Decomposition
- A general bijective algorithm for increasing trees
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)
