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

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Theoretical computer science Ročník 922; s. 312 - 334
Hlavní autori:	Ingels, Florian, Azaïs, Romain
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 24.06.2022 Elsevier
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!