Minimax Trees in Linear Time with Applications

DOI10.1007/978-3-642-10217-2_28zbMATH Open1267.05259OpenAlexW2176898149MaRDI QIDQ3651553

Travis Gagie, Paweł Gawrychowski

Publication date: 11 December 2009

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

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2009/2242/

zbMATH Keywords

Huffman treeminimax tree

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (7)

A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree ⋮ Constructing a minimum height elimination tree of a tree in linear time ⋮ On Linear Time Minor Tests with Depth-First Search ⋮ Linearity of grid minors in treewidth with applications through bidimensionality ⋮ Minimax trees in linear time with applications ⋮ Min-max Computation Tree Logic ⋮ Unnamed Item

Recommendations

• Unnamed Item 👍 👎
• Unnamed Item 👍 👎
• Minimax trees in linear time with applications 👍 👎
• Minimum projective linearizations of trees in linear time 👍 👎
• Linear-time algorithms for tree root problems 👍 👎
• A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree 👍 👎
• Minimax trees, paths, and cut sets 👍 👎
• Approximation Algorithms for Min–Max Tree Partition 👍 👎
• Alphabetic Minimax Trees in Linear Time 👍 👎
• Linear-Time Algorithms for Tree Root Problems 👍 👎

This page was built for publication: Minimax Trees in Linear Time with Applications