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.68105OpenAlexW2073122993MaRDI 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
Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) General topics in the theory of software (68N01)
Related Items (5)
Hamiltonicity, pancyclicity, and full cycle extendability in multipartite tournaments ⋮ Multipartite tournaments: a survey ⋮ Finding cheapest cycles in vertex-weighted quasi-transitive and extended semicomplete digraphs ⋮ Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs ⋮ Semicomplete Multipartite Digraphs
This page was built for publication: A Polynomial Time Algorithm for Finding a Cycle Covering a Given Set of Vertices in a Semicomplete Multipartite Digraph
