On the complexity of the 3-kernel problem in some classes of digraphs (Q2442275)
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 6277517
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of the 3-kernel problem in some classes of digraphs |
scientific article; zbMATH DE number 6277517 |
Statements
On the complexity of the 3-kernel problem in some classes of digraphs (English)
0 references
2 April 2014
0 references
kernel
0 references
3-kernel
0 references
NP-completeness
0 references
multipartite tournament
0 references
cyclically 3-partite digraphs
0 references
k-quasi-transitive digraph
0 references
0 references
0.8801934123039246
0 references
0.8381910920143127
0 references
0.8248752355575562
0 references
0.8170025944709778
0 references
0.8169900178909302
0 references
