A Polynomial Time Algorithm for Finding a Cycle Covering a Given Set of Vertices in a Semicomplete Multipartite Digraph (Q4939609): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 18:07, 5 March 2024
scientific article; zbMATH DE number 1400085
Language | Label | Description | Also known as |
---|---|---|---|
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