Jørgen Bang-Jensen, Gregory Gutin  Home/Search
Context Related
| imada.ou.dk/pub/papers/pp19...41.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: fermivista.math...ftp.imada.ou.dk (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We survey results on the sequential and parallel complexity of hamiltonian path and cycle problems in various classes of digraphs which generalize tournaments. We give detailed informations on the difference in difficulties for these problems for the various classes as well as prove new results on hamiltonian paths starting in a specified vertex for a quite general class of digraphs. (Update)
Cited by: More
Strongly Connected Spanning Subgraphs With the Minimum.. - Bang-Jensen, Yeo (2000) (Correct)
Active bibliography (related documents): More All
4.5: Generalizations of tournaments: A survey - Bang-Jensen, Gutin (1996) (Correct)
2.0: Semicomplete Multipartite Digraphs - Yeo (1998) (Correct)
1.4: Cycles in Semicomplete Multipartite Digraphs - Yeo (1996) (Correct)
Similar documents based on text: More All
0.5: An Extremal Connectivity Parameter of Tournaments - Klostermeyer, Soltés (Correct)
0.4: Antidirected Hamiltonian Paths Between Specified Vertices of.. - Hell, Rosenfeld (Correct)
0.3: A sufficient condition for a semicomplete multipartite.. - Bang-Jensen, Gutin.. (1997) (Correct)
BibTeX entry: (Update)
J. Bang-Jensen and G. Gutin, On the complexity of hamiltonian path and cycle problems in certain classes of digraphs, Discrete Applied Mathematics, to appear. http://citeseer.ist.psu.edu/bang-jensen97complexity.html More
@article{ bangjensen99complexity,
author = "Bang-Jensen and Gutin",
title = "On the complexity of hamiltonian path and cycle problems in certain classes of digraphs",
journal = "DAMATH: Discrete Applied Mathematics and Combinatorial Operations Research and Computer Science",
volume = "95",
year = "1999",
url = "citeseer.ist.psu.edu/bang-jensen97complexity.html" }
Citations (may not include all citations):773 Reducibility among combinatorial problems (context) - Karp - 1972
537 Graph Theory with Applications (context) - Bondy, Murty - 1976
227 Parallel merge sort (context) - Cole - 1988
106 Matching is as easy as matrix inversion (context) - Mulmuley, Vazirani et al. - 1987
102 A survey of parallel algorithms for shared memory machines (context) - Karp, Ramachandran - 1990
35 Prentice-Hall Inc (context) - Papadimitriou, Steiglitz et al. - 1982
32 Rinehart and Winston (context) - Moon, Tournaments - 1968
28 Computing of maximum cardinality matching in a bipartite gra.. (context) - Alt, Blum et al. - 1991
27 Magnanti and J (context) - Ahuja - 1993
18 Cycles and paths in bipartite tournaments with spanning conf.. (context) - Haggkvist, Manoussakis - 1989
17 A criterion for complete bipartite digraphs to be Hamiltonia.. (context) - Gutin - 1984
16 One-diregular subgraphs in semicomplete multipartite digraph.. - Yeo - 1997
15 Quasi-transitive digraphs (context) - Bang-Jensen, Huang - 1995
11 Locally semicomplete digraphs: A generalizations of tourname.. (context) - Bang-Jensen - 1990
11 Tel Aviv Univ (context) - Gutin, cycles et al. - 1993
11 Polynomial algorithms for finding hamiltonian paths and cycl.. (context) - Gutin - 1994
11 Finding a longest path in a complete multipartite digraph (context) - Gutin - 1993
10 Polynomial algorithms for finding cycles and paths in bipart.. (context) - Manoussakis, Tuza - 1990
10 partite digraphs that have a Hamiltonian path (context) - Gutin, of et al. - 1988
9 Hamiltonian connected tournaments (context) - Thomassen - 1980
9 A polynomial algorithm for the 2-path problem for semicomple.. (context) - Bang-Jensen, Thomassen - 1992
8 A linear time algorithm for finding Hamiltonian cycle in tou.. (context) - Manoussakis - 1992
7 Huang and E (context) - Bang-Jensen - 1993
7 Houri, Caract (context) - Ghouila- - 1962
7 Weakly hamiltonian-connected vertices in bipartite tournamen.. (context) - Bang-Jensen, Manoussakis - 1995
7 A sufficient condition for a semicomplete multipartite digra.. (context) - Bang-Jensen, Gutin et al. - 1996
6 Cycles and paths in complete multipartite digraphs (context) - Gutin - 1995
6 A polynomialalgorithm for the Hamiltonian cycle problem in s.. (context) - Bang-Jensen, Gutin et al.
6 Sufficient Conditions for a Digraph to be Hamiltonian (context) - Bang-Jensen, Gutin et al. - 1996
6 Vertex heaviest paths and cycles in quasi-transitive digraph.. (context) - Bang-Jensen, Gutin - 1996
5 Hamilton paths in multipartite oriented graphs (context) - Zhang - 1989
5 Finite Graphs and Networks (context) - Busaker, Saaty - 1965
5 The complexity of finding generalized paths in tournaments (context) - Hell, Rosenfeld - 1983
4 Fast parallel algorithms for finding Hamiltonian paths and c.. (context) - Soroker - 1988
4 Digraphs with the path-merging property (context) - Bang-Jensen - 1995
4 trees and cycles in tournaments (context) - Bang-Jensen, Gutin - 1996
4 Fast algorithms for finding hamiltonian paths and cycles in .. (context) - Bang-Jensen, Hell - 1991
4 A polynomial algorithm for hamiltonian-connectedness in semi.. (context) - Bang-Jensen, Manoussakis et al. - 1992
3 Parallel algorithms for hamiltonian paths with specified (context) - Bang-Jensen, Haddad - 1996
3 Paths and cycles in extended and decomposable digraphs (context) - Bang-Jensen, Gutin - 1997
2 Two parallel algorithms in graph theory (context) - Naor - 1986
2 Department of Mathematics and Computer Science (context) - Bang-Jensen, Gutin et al. - 1996
2 Graphs for which every unilateral orientation is traceable (context) - Fink, Lesniak-Forster - 1980
2 and hamiltonian paths in tournaments (context) - Bar-Noy, Naor et al. - 1990
2 Parallel algorithms for the Hamiltonian cycle and Hamiltonia.. (context) - Bang-Jensen, Haddad et al. - 1997
2 A parallel reduction of hamilton cycle to hamilton path in t.. (context) - Bampis, Haddad et al. - 1995
2 Weakly hamiltonian-connected locally semicomplete digraphs (context) - Bang-Jensen, Guo et al. - 1996
2 Weekly hamiltonian-connected ordinary multipartite tournamen.. (context) - Bang-Jensen, Gutin et al. - 1995
2 Strongly hamiltonian-connected locally semicomplete digraphs (context) - Guo - 1996
1 Fast parallel algorithms for graphs and networks (context) - Soroker - 1987
Documents on the same site (http://fermivista.math.jussieu.fr/ftp/ftp.imada.ou.dk.html): More
Regular Expressions with Nested Levels of Back Referencing Form a .. - Larsen (1997) (Correct)
Optimal Rebalancing of Binary Search Trees - Fagerberg (1996) (Correct)
Digit-Set Conversions: Generalizations and Applications - Kornerup (1995) (Correct)
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