A Polynomial Algorithm for the 2-Path Problem for Semicomplete Digraphs (Q4018846)
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 90669
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Polynomial Algorithm for the 2-Path Problem for Semicomplete Digraphs |
scientific article; zbMATH DE number 90669 |
Statements
A Polynomial Algorithm for the 2-Path Problem for Semicomplete Digraphs (English)
0 references
16 January 1993
0 references
tournaments
0 references
semicomplete digraphs
0 references
polynomial algorithms
0 references
NP- completeness
0 references
feedback vertex set
0 references
feedback arcset
0 references
2-path problem
0 references
0.8489907383918762
0 references
0.8352693915367126
0 references
0.8286769390106201
0 references
