Sublinear-time algorithms for tournament graphs

DOI10.1007/s10878-010-9325-7zbMath1229.90156OpenAlexW1977876681WikidataQ59202521 ScholiaQ59202521MaRDI QIDQ652634

Tom Friedetzky, Lars Nagel, Stefan S. Dantchev

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)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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