FPT algorithms to enumerate and count acyclic and totally cyclic orientations (Q2132402)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: FPT algorithms to enumerate and count acyclic and totally cyclic orientations |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | FPT algorithms to enumerate and count acyclic and totally cyclic orientations |
scientific article |
Statements
FPT algorithms to enumerate and count acyclic and totally cyclic orientations (English)
0 references
27 April 2022
0 references
acyclic orientations
0 references
totally cyclic orientations
0 references
parameterized algorithms
0 references
FPT algorithms
0 references
path-width
0 references
branch-width
0 references
binary decision diagram
0 references
0 references
