High Spies (or How to Win a Programming Contest)

DOI10.1007/978-3-540-72914-3_10MaRDI QIDQ5426018zbMATH OpenOpenAlexFDO

Authors A. H. Deutz, Rudy Van Vliet, Hendrik Jan Hoogeboom

Publication date 15 November 2007

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

Full work available at URL https://doi.org/10.1007/978-3-540-72914-3_10

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• An Optimal Algorithm for Weighted Minimax Flow Centers on Trees
• scientific article; zbMATH DE number 3891405
• Alphabetic Minimax Trees
• Searches on a Binary Tree with Random Edge-Weights
• On finding most uniform spanning trees

This page was built for publication: High Spies (or How to Win a Programming Contest)

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