A Polynomial Time Algorithm for Finding a Cycle Covering a Given Set of Vertices in a Semicomplete Multipartite Digraph
From MaRDI portal
Publication:4939609
DOI10.1006/jagm.1999.1041zbMath0946.68105MaRDI QIDQ4939609
Publication date: 17 October 2000
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/11f8426fe9bbbc241ccd9f66923c0e5aa4d8f090
68R10: Graph theory (including graph drawing) in computer science
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C85: Graph algorithms (graph-theoretic aspects)
68N01: General topics in the theory of software
Related Items
Hamiltonicity, pancyclicity, and full cycle extendability in multipartite tournaments, Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs, Multipartite tournaments: a survey, Finding cheapest cycles in vertex-weighted quasi-transitive and extended semicomplete digraphs, Semicomplete Multipartite Digraphs