Sublinear-Time Algorithms for Tournament Graphs

DOI10.1007/978-3-642-02882-3_46zbMath1248.05197OpenAlexW102444583WikidataQ59202525 ScholiaQ59202525MaRDI QIDQ5323094

Tom Friedetzky, Lars Nagel, Stefan S. Dantchev

Publication date: 23 July 2009

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

Full work available at URL: https://doi.org/10.1007/978-3-642-02882-3_46

zbMATH Keywords

random walktournamentsink3-cyclesublinear-time algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20) Random walks on graphs (05C81)

Cites Work

• How easy is local search?
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Sublinear-Time Algorithms for Tournament Graphs