2020
DOI: 10.48550/arxiv.2003.08144
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Enumeration of Irredundant Forests

Florian Ingels,
Romain Azaïs

Abstract: Reverse search is a convenient method for enumerating structured objects, that can be used both to address theoretical issues and to solve data mining problems. This method has already been successfully developed to handle unordered trees. If the literature proposes solutions to enumerate singletons of trees, we study in this article a more general, higher combinatorial problem, the enumeration of sets of trees -forests. By compressing each forest into a Directed Acyclic Graph (DAG), we develop a reverse searc… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 15 publications
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?