NC algorithms for antidirected hamiltonian paths and cycles in tournaments

DOI10.1007/3-540-59071-4_63zbMath1528.05065MaRDI QIDQ6184385

Evripidis Bampis, Yannis Manoussakis, Ioannis Milis

Publication date: 5 January 2024

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Parallel algorithms in computer science (68W10) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Unnamed Item
• Antidirected Hamiltonian circuits in tournaments
• Antidirected Hamilton circuits and paths in tournaments
• The complexity of finding generalized paths in tournaments
• Fast parallel algorithms for finding hamiltonian paths and cycles in a tournament
• A polynomial algorithm for hamiltonian-connectedness in semicomplete digraphs
• A Polynomial Algorithm for the 2-Path Problem for Semicomplete Digraphs
• Sorting, Minimal Feedback Sets, and Hamilton Paths in Tournaments
• The Parallel Evaluation of General Arithmetic Expressions
• Disproof of a conjecture of Erdös and moser on tournaments
• Antidirected Hamiltonian paths in tournaments
• Antidirected Hamiltonian paths in tournaments

This page was built for publication: NC algorithms for antidirected hamiltonian paths and cycles in tournaments