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
Set profile property. |
Set OpenAlex properties. |
||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2073122993 / rank | |||
Normal rank | |||
Latest revision as of 22:17, 19 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
