On the computational complexity of path cover problems (Q799105)
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: On the computational complexity of path cover problems |
scientific article; zbMATH DE number 3872679
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the computational complexity of path cover problems |
scientific article; zbMATH DE number 3872679 |
Statements
On the computational complexity of path cover problems (English)
0 references
1984
0 references
path cover problems
0 references
acyclic digraphs
0 references
acyclic structured digraphs
0 references
rooted trees
0 references
reachability relation
0 references
