Enumeration of irredundant forests

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...

Full description

Saved in:

Bibliographic Details
Published in:	Theoretical computer science Vol. 922; pp. 312 - 334
Main Authors:	Ingels, Florian, Azaïs, Romain
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 24.06.2022 Elsevier
Subjects:	Combinatorics Computer Science Data Structures and Algorithms Directed acyclic graph Discrete Mathematics Enumeration Forest Mathematics Reverse search Unordered trees Directed acyclic graph Forest Enumeration Reverse search Unordered trees Unordered Trees Directed Acyclic Graph Reverse Search
ISSN:	0304-3975, 1879-2294
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!