Download:
|
by Anders Yeo
http://www.brics.dk/~yeo/PS_file/PAPERS/Y1998/11.ps
Add To MetaCart
Abstract:
A polynomial algorithm for finding a cycle covering a given set of vertices in a semicomplete multipartite digraph
Citations
|
893
|
Graph Theory with Applications
– Bondy, Murty
- 1976
|
|
30
|
Cycles and paths in semicomplete multipartite digraphs, theorems and algorithms: a survey
– Gutin
|
|
25
|
Cycles and paths in bipartite tournaments with spanning configurations, Combinatorica 9
– Häggkvist, Manoussakis
- 1989
|
|
23
|
A criterion for complete bipartite digraphs to be Hamiltonian, Vestsi Acad
– Gutin
- 1984
|
|
20
|
A polynomial algorithm for the 2path problem for semicomplete digraphs
– Bang-Jensen, Thomassen
- 1992
|
|
20
|
One-diregular subgraphs in semicomplete multipartite digraphs, submitted
– Yeo
|
|
16
|
Chemins et circuits hamiltoniens des graphes complets
– Camion
- 1959
|
|
15
|
Polynomial algorithms for finding cycles and paths in bipartite tournaments
– Manoussakis, Tuza
- 1990
|
|
14
|
A polynomial algorithm for the Hamiltonian cycle problem in semicomplete multipartite digraphs
– Bang-Jensen, Gutin, et al.
- 1998
|
|
14
|
paths in multipartite oriented graphs
– Zhang, Hamilton
- 1989
|
|
13
|
A sufficient condition for a semicomplete multipartite digraph to be Hamiltonian, Discrete Math
– Bang-Jensen, Gutin, et al.
- 1996
|
|
13
|
Paths and cycles in digraphs
– Gutin
- 1993
|
|
11
|
Weakly Hamiltonian-connected vertices in bipartite tournaments
– Bang-Jensen, Manoussakis
- 1995
|
|
7
|
Hamiltonian cycles avoiding prescribed arcs
– Bang-Jensen, Gutin, et al.
- 1997
|
|
7
|
Cycles through k vertices and k arcs in bipartite tournaments
– Bang-Jensen, Manoussakis
- 1994
|
