A polynomial algorithm for Hamiltonian-connectedness in semicomplete digraphs
Journal of Algorithms
A polynomial algorithm for the 2-path problem for semicomplete digraphs
SIAM Journal on Discrete Mathematics
Finding a longest path in a complete multipartite digraph
SIAM Journal on Discrete Mathematics
Weakly Hamiltonian-connected ordinary multipartite tournaments
Selected papers of the 14th British conference on Combinatorial conference
Journal of the ACM (JACM)
One-diregular subgraphs in semicomplete multipartite digraphs
Journal of Graph Theory
On Feedback Problems in Diagraphs
WG '89 Proceedings of the 15th International Workshop on Graph-Theoretic Concepts in Computer Science
Aggregating inconsistent information: ranking and clustering
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments
Combinatorics, Probability and Computing
Generalizations of tournaments: A survey
Journal of Graph Theory
A polynomial algorithm for the Hamiltonian cycle problem in semicomplete multipartite digraphs
Journal of Graph Theory
Digraphs: Theory, Algorithms and Applications
Digraphs: Theory, Algorithms and Applications
Computing slater rankings using similarities among candidates
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Weakly quasi-Hamiltonian-set-connected multipartite tournaments
Discrete Applied Mathematics
| Hi-index | 0.04 |
A quasi-hamiltonian path in a semicomplete multipartite digraph D is a path which visits each maximal independent set (also called a partite set) of D at least once. This is a generalization of a hamiltonian path in a tournament. In this paper we investigate the complexity of finding a quasi-hamiltonian path, in a given semicomplete multipartite digraph, from a prescribed vertex x to a prescribed vertex y as well as the complexity of finding a quasi-hamiltonian path whose end vertices belong to a given set of two vertices {x,y}. While both of these problems are polynomially solvable for semicomplete digraphs (here all maximal independent sets have size one), we prove that the first problem is NP-complete and describe a polynomial algorithm for the latter problem.