J. Bang-Jensen, Y. Manoussakis, C. Thomassen, A polynomial algorithm for Hamiltonian-connectedness in semicomplete digraphs. J. Algorithms 13 (1992) 114127. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Cycles in Semicomplete Multipartite Digraphs - Yeo (1996) (Correct)
....6.5 Every diregular BT is decomposable into Hamiltonian cycles. This was some of the interesting open problems concerning SMD s and BT s. Some other interesting open problems concerning tournaments and semicomplete digraphs are the following. J. Bang Jensen, Y. Manoussakis and C. Thomassen [14] conjectured the following: Conjecture 6.6 For each fixed k, there exists a polynomial algorithm for deciding if there exists a Hamiltonian cycle through k prescribed arcs in a tournament. Conjecture 6.7 For any fixed natural number k there exists a polynomial algorithm to decide the existence of ....
J. Bang-Jensen, Y. Manoussakis, C. Thomassen, A polynomial algorithm for Hamiltonian-connectedness in semicomplete digraphs. J. Algorithms 13 (1992) 114127.
On the Complexity of Hamiltonian Path and Cycle Problems in .. - Bang-Jensen, Gutin (1997) Self-citation (Bang-jensen) (Correct)
....that the existence of a hamiltonian path between x and y can be checked in time O(n 2 ) Moreover, the proof of the characterization in [48] provides an O(n 2 ) algorithm for constructing a hamiltonian path between x and y (if one exists) J. Bang Jensen, Y. Manoussakis and C. Thomassen [21] considered the much more difficult HPxy problem for semicomplete digraphs. The authors of [21] found a polynomial algorithm for solving the HPxy problem based on a number of structural results. The question of the existence of such an algorithm for tournaments was raised by Soroker [47] Theorem ....
....) Moreover, the proof of the characterization in [48] provides an O(n 2 ) algorithm for constructing a hamiltonian path between x and y (if one exists) J. Bang Jensen, Y. Manoussakis and C. Thomassen [21] considered the much more difficult HPxy problem for semicomplete digraphs. The authors of [21] found a polynomial algorithm for solving the HPxy problem based on a number of structural results. The question of the existence of such an algorithm for tournaments was raised by Soroker [47] Theorem 4.2 [21] There exists an O(n 5 ) algorithm to check whether a given semicomplete digraph of ....
[Article contains additional citation context not shown here]
J. Bang-Jensen, Y. Manoussakis and C. Thomassen, A polynomial algorithm for hamiltonian-connectedness in semicomplete digraphs. J. Algorithms 13 (1992) 114-127.
Generalizations of tournaments: A survey - Bang-Jensen, Gutin (1996) Self-citation (Bang-jensen) (Correct)
....x and y (the definition of arc 3 cyclic digraphs is given in the next section) In particular this characterization shows that there exist infinitely many 3 strongly connected digraphs which are locally tournament digraphs but not tournaments and are not strongly hamiltonian connected. In [28] a polynomial algorithm for deciding whether a given semicomplete digraph has a hamiltonian path with specified initial and terminal vertices was described. It is interesting to note that this algorithm cannot be easily modified to solve the problem of finding the longest path with specified ....
....any simple reduction of this problem to the problem of deciding the existence of a hamiltonian path from x to y. Conjecture 9.4 There exists a polynomial algorithm which given a semicomplete digraph D and two distinct vertices x and y of D finds a longest (x; y) path. We believe that the result in [28] can be generalized to extended semicomplete digraphs and locally semicomplete digraphs. Conjecture 9.5 There exists a polynomial algorithm which given an extended semicomplete digraph (a locally semicomplete digraph, resp. D and two distinct vertices x and y of D decides whether D has a ....
J. Bang-Jensen, Y. Manoussakis and C. Thomassen, A polynomial algorithm for hamiltonian-connectedness in semicomplete digraphs. J. Algorithms 13 (1992) 114-127.
Semicomplete Multipartite Digraphs - Yeo (1998) (Correct)
No context found.
J. Bang-Jensen, Y. Manoussakis, C. Thomassen, A polynomial algorithm for Hamiltonian-connectedness in semicomplete digraphs. J. Algorithms 13 (1992) 114127.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC