The complexity of finding generalized paths in tournaments

DOI10.1016/0196-6774(83)90011-1zbMath0532.68069OpenAlexW2024385930MaRDI QIDQ3315014

Moshe Rosenfeld, Pavol Hell

Publication date: 1983

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0196-6774(83)90011-1

zbMATH Keywords

complexitytournamentgeneralized paths

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38)

Related Items (10)

Parallel algorithms for the Hamiltonian cycle and Hamiltonian path problems in semicomplete bipartite digraphs ⋮ Antidirected Hamiltonian paths between specified vertices of a tournament ⋮ The complexity of finding certain trees in tournaments ⋮ Tight bounds for finding degrees from the adjacency matrix ⋮ NC algorithms for antidirected hamiltonian paths and cycles in tournaments ⋮ ON COST-OPTIMAL MERGE OF TWO INTRANSITIVE SORTED SEQUENCES ⋮ A linear-time algorithm for finding Hamiltonian cycles in tournaments ⋮ Pancyclicity in strong \(k\)-quasi-transitive digraphs of large diameter ⋮ Fast algorithms for finding Hamiltonian paths and cycles in in-tournament digraphs ⋮ A structured family of clustering and tree construction methods

This page was built for publication: The complexity of finding generalized paths in tournaments