Enumeration of irredundant forests
From MaRDI portal
Publication:2672596
DOI10.1016/j.tcs.2022.04.033OpenAlexW4224329931MaRDI QIDQ2672596
Publication date: 13 June 2022
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2003.08144
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Counting general and self-dual interval orders
- Asymptotics for the number of row-Fishburn matrices
- On generating all maximal independent sets
- On enumerating all minimal solutions of feedback problems
- Efficient generation of plane trees.
- Reverse search for enumeration
- Asymptotics and statistics on Fishburn matrices and their generalizations
- Topological sorting of large networks
- An Automatic Method for Solving Discrete Programming Problems
- Approximation of trees by self-nested trees
- Graph Drawing
- Enumeration of nonisomorphic interval graphs and nonisomorphic permutation graphs
This page was built for publication: Enumeration of irredundant forests