On the complexity of the 3-kernel problem in some classes of digraphs (Q2442275): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 08:11, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of the 3-kernel problem in some classes of digraphs |
scientific article |
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
