A polynomial algorithm for Hamiltonian-connectedness in semicomplete digraphs

Authors:
Jørgen Bang-Jensen;Yannis Manoussakis;Carsten Thomassen
Affiliations:
-;-;-
Venue:
Journal of Algorithms
Year:
1992

Citing 0
Cited 3

Complexity of paths, trails and circuits in arc-colored digraphs

TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Complexity of trails, paths and circuits in arc-colored digraphs

Discrete Applied Mathematics
Quasi-hamiltonian paths in semicomplete multipartite digraphs

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract