A Polynomial Algorithm for finding a cycle covering a given set of vertices in a semicomplete multipartite digraph

Research output: Contribution to journal › Article › peer-review

Cite this

@article{30989ee58b6c4d0fa2122705c54a3c1d,

title = "A Polynomial Algorithm for finding a cycle covering a given set of vertices in a semicomplete multipartite digraph",

author = "Anders Yeo",

year = "1999",

language = "Undefined/Unknown",

volume = "33",

pages = "124--139",

journal = "Journal of Algorithms",

issn = "1090-2678",

publisher = "Elsevier Inc.",

number = "1",

}