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

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Theoretical computer science Jg. 922; S. 312 - 334
Hauptverfasser:	Ingels, Florian, Azaïs, Romain
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 24.06.2022 Elsevier
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!