On the Complexity of Hamiltonian Path and Cycle Problems in Certain Classes of Digraphs
暂无分享,去创建一个
[1] Andrzej Ehrenfeucht,et al. An O(n²) Divide-and-Conquer Algorithm for the Prime Tree Decomposition of Two-Structures and Modular Decomposition of Graphs , 1994, J. Algorithms.
[2] Gregory Gutin,et al. Polynomial algorithms for finding paths and cycles in quasi-transitive digraphs , 1994, Australas. J Comb..
[3] Joseph Naor,et al. Sorting, Minimal Feedback Sets, and Hamilton Paths in Tournaments , 1990, SIAM J. Discret. Math..
[4] Jørgen Bang-Jensen,et al. Quasi-transitive digraphs , 1995, J. Graph Theory.
[5] Gregory Gutin,et al. Sufficient conditions for a digraph to be Hamiltonian , 1996, J. Graph Theory.
[6] Danny Soroker,et al. Fast Parallel Algorithms for Graphs and Networks , 1987 .
[7] Richard Cole,et al. Parallel merge sort , 1988, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).
[8] Richard M. Karp,et al. Parallel Algorithms for Shared-Memory Machines , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.
[9] Vijay V. Vazirani,et al. Matching is as easy as matrix inversion , 1987, STOC.
[10] Gregory Gutin,et al. A sufficient condition for a semicomplete multipartite digraph to be Hamiltonian , 1993, Discret. Math..
[11] Jørgen Bang-Jensen,et al. Digraphs with the path-merging property , 1995, J. Graph Theory.
[12] Kenneth Steiglitz,et al. Combinatorial Optimization: Algorithms and Complexity , 1981 .
[13] Yannis Manoussakis,et al. A Polynomial Algorithm for Hamiltonian-Connectedness in Semicomplete Digraphs , 1992, J. Algorithms.
[14] Yubao Guo. Strongly Hamiltonian-connected locally semicomplete digraphs , 1996 .
[15] Gregory Gutin,et al. Finding a Longest Path in a Complete Multipartite Digraph , 1993, SIAM J. Discret. Math..
[16] R. Häggkvist,et al. Cycles and paths in bipartite tournaments with spanning configurations , 1989, Comb..
[17] Zsolt Tuza,et al. Polynomial Algorithms for Finding Cycles and Paths in Bipartite Tournaments , 1990, SIAM J. Discret. Math..
[18] Gregory Gutin,et al. Paths and cycles in extended and decomposable digraphs, , 1997, Discret. Math..
[19] C.-Q. Zhang. Hamilton Paths in Multipartite Oriented Graphs , 1988 .
[20] Gregory Gutin,et al. A polynomial algorithm for the Hamiltonian cycle problem in semicomplete multipartite digraphs , 1998, J. Graph Theory.
[21] G. Gutin,et al. Generalizations of tournaments: A survey , 1998 .
[22] Jørgen Bang-Jensen,et al. Fast Algorithms for Finding Hamiltonian Paths and Cycles in In-Tournament Digraphs , 1993, Discret. Appl. Math..
[23] J. A. Bondy,et al. Graph Theory with Applications , 1978 .
[24] A. T. Berztiss. Paths and Cycles in Digraphs , 1971 .
[25] Gregory Gutin,et al. Sucient conditions for a digraph to be Hamiltonian , 1996 .
[26] Danny Soroker. Fast Parallel Algorithms for Finding Hamiltonian Paths and Cycles in a Tournament , 1988, J. Algorithms.
[27] Kurt Mehlhorn,et al. Computing a Maximum Cardinality Matching in a Bipartite Graph in Time O(^1.5 sqrt m/log n) , 1991, Inf. Process. Lett..
[28] Anders Yeo,et al. One-diregular subgraphs in semicomplete multipartite digraphs , 1997, J. Graph Theory.
[29] Carsten Thomassen,et al. A Polynomial Algorithm for the 2-Path Problem for Semicomplete Digraphs , 1992, SIAM J. Discret. Math..
[30] Yannis Manoussakis,et al. A linear-time algorithm for finding Hamiltonian cycles in tournaments , 1992, Discret. Appl. Math..
[31] Carsten Thomassen,et al. Hamiltonian-connected tournaments , 1980, J. Comb. Theory, Ser. B.
[32] J rgen Bang-Jensen,et al. Parallel Algorithms for Hamiltonian Paths with Specified (unordered) Endvertices in Semicomplete Bipartite Digraphs and Extended Tournaments , 1996 .
[33] Pavol Hell,et al. The Complexity of Finding Generalized Paths in Tournaments , 1983, J. Algorithms.
[34] Lutz Volkmann,et al. Weakly Hamiltonian-connected locally semicomplete digraphs , 1996, J. Graph Theory.
[35] Jørgen Bang-Jensen,et al. Locally semicomplete digraphs: A generalization of tournaments , 1990, J. Graph Theory.
[36] J. Moon. Topics on tournaments , 1968 .
[37] Gregory Gutin,et al. Vertex heaviest paths and cycles in quasi-transitive digraphs , 1997, Discret. Math..
[38] Evripidis Bampis,et al. A Parallel Reduction of Hamiltonian Cycle to Hamiltonian Path in Tournaments , 1995, J. Algorithms.
[39] Yannis Manoussakis,et al. Weakly Hamiltonian-Connected Vertices in Bipartite Tournaments , 1995, J. Comb. Theory, Ser. B.
[40] Gregory Gutin,et al. Cycles and paths in semicomplete multipartite digraphs, theorems, and algorithms: a survey , 1995, J. Graph Theory.
[41] Gregory Gutin,et al. Weakly Hamiltonian-connected ordinary multipartite tournaments , 1995, Discret. Math..