A Polynomial Time Algorithm for Finding a Cycle Covering a Given Set of Vertices in a Semicomplete Multipartite Digraph (Q4939609)
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: Publication:4939609 |
scientific article; zbMATH DE number 1400085
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Polynomial Time Algorithm for Finding a Cycle Covering a Given Set of Vertices in a Semicomplete Multipartite Digraph |
scientific article; zbMATH DE number 1400085 |
Statements
A Polynomial Time Algorithm for Finding a Cycle Covering a Given Set of Vertices in a Semicomplete Multipartite Digraph (English)
0 references
17 October 2000
0 references
polynomial time algorithm
0 references
semicomplete bipartite digraph
0 references
0.8203141093254089
0 references
0.8172871470451355
0 references
0.8167080879211426
0 references
0.7709466814994812
0 references
0.7709466814994812
0 references
