Minimax Trees in Linear Time with Applications

DOI10.1007/978-3-642-10217-2_28MaRDI QIDQ3651553zbMATH OpenOpenAlexFDO

Authors Paweł Gawrychowski, Travis Gagie

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)

Recommendations

• Minimax trees in linear time with applications
• Alphabetic minimax trees in linear time
• scientific article; zbMATH DE number 895355
• Minimum projective linearizations of trees in linear time
• scientific article; zbMATH DE number 30748
• Minimax trees, paths, and cut sets
• A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree
• Approximation Algorithms for Min–Max Tree Partition
• Linear-time algorithms for tree root problems
• Linear-Time Algorithms for Tree Root Problems

Cited in

(13)

• Minimax trees in linear time with applications
• Online binary minimax trees
• A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree
• A new algorithm for building alphabetic minimax trees
• Alphabetic Minimax Trees
• Alphabetic Minimax Trees of Degree at Most t
• scientific article; zbMATH DE number 30748 (Why is no real title available?)
• On Linear Time Minor Tests with Depth-First Search
• FUNCTIONAL PEARL On building trees with minimum height
• Alphabetic minimax trees in linear time
• Min-max Computation Tree Logic
• Constructing a minimum height elimination tree of a tree in linear time
• Linearity of grid minors in treewidth with applications through bidimensionality

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

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