Sublinear-time algorithms for tournament graphs

DOI10.1007/S10878-010-9325-7MaRDI QIDQ652634zbMATH OpenOpenAlexWikidataFDO

Authors Tom Friedetzky, Lars Nagel, Stephan Stoyanov Danchev

Publication date 15 December 2011

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10878-010-9325-7

zbMATH Keywords

random walktournamentsublinear-time algorithms

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Recommendations

• Sublinear-Time Algorithms for Tournament Graphs
• The complexity of finding certain trees in tournaments
• Finding Scores in Tournaments
• Fast algorithms for finding Hamiltonian paths and cycles in in-tournament digraphs
• A linear-time algorithm for finding Hamiltonian cycles in tournaments

Cited in

(4)

• An efficient algorithm for stopping on a sink in a directed graph
• Optimal parallel construction of prescribed tournaments
• Finding and counting small tournaments in large tournaments
• Sublinear-Time Algorithms for Tournament Graphs

This page was built for publication: Sublinear-time algorithms for tournament graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q652634)