The complexity of finding certain trees in tournaments

DOI10.1007/3-540-57155-8_243zbMath1504.68153OpenAlexW1486093398MaRDI QIDQ5060108

G. Srinivasaraghavan, R. Balasubramanian, Venkatesh Raman

Publication date: 18 January 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-57155-8_243

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

Tight bounds for finding degrees from the adjacency matrix

Cites Work

• Unnamed Item
• Realization of certain generalized paths in tournaments
• Antidirected Hamiltonian circuits in tournaments
• Parity of paths and circuits in tournaments
• The complexity of finding generalized paths in tournaments
• Antidirected Hamiltonian paths in tournaments
• Antidirected Hamiltonian paths in tournaments

This page was built for publication: The complexity of finding certain trees in tournaments