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 the normal view instead:
scientific article; zbMATH DE number 3872679
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.7868620157241821
0 references
0.7561084628105164
0 references
0.7528007626533508
0 references
0.7527661323547363
0 references
