A linear-time parameterized algorithm for computing the width of a DAG (Q2672441)
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: A linear-time parameterized algorithm for computing the width of a DAG |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A linear-time parameterized algorithm for computing the width of a DAG |
scientific article |
Statements
A linear-time parameterized algorithm for computing the width of a DAG (English)
0 references
8 June 2022
0 references
directed acyclic graph
0 references
maximum antichain
0 references
DAG width
0 references
posets
0 references
parameterized algorithms
0 references
reachability queries
0 references
0 references
0 references
0 references
0 references
