Complexity of some arc-partition problems for digraphs (Q2079880)
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: Complexity of some arc-partition problems for digraphs |
scientific article; zbMATH DE number 7597584
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of some arc-partition problems for digraphs |
scientific article; zbMATH DE number 7597584 |
Statements
Complexity of some arc-partition problems for digraphs (English)
0 references
7 October 2022
0 references
digraphs
0 references
arc-partitions
0 references
NP-complete
0 references
polynomial algorithm
0 references
branchings
0 references
strong subdigraphs
0 references
cycle factor
0 references
acyclic digraph
0 references
0 references
0.9007993936538696
0 references
0.8971220850944519
0 references
0.856360912322998
0 references
0.8462246060371399
0 references
0.828143298625946
0 references
