Algorithms

DOI10.1016/0001-8708(75)90153-XzbMath0301.68050OpenAlexW4210973561MaRDI QIDQ5905704

Daniel J. Kleitman

Publication date: 1975

Published in: Advances in Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0001-8708(75)90153-x

Mathematics Subject Classification ID

Algorithms in computer science (68W99)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Gaussian elimination is not optimal
• Algorithms for constructing graphs and digraphs with given valences and factors
• Expected time bounds for selection
• Efficient Planarity Testing
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• A bad network problem for the simplex method and other minimum cost flow algorithms
• A Method for the Construction of Minimum-Redundancy Codes
• Bounds on Multiprocessing Timing Anomalies
• Optimal Computer Search Trees and Variable-Length Alphabetical Codes
• On the existence of N‐connected graphs with prescribed degrees (n ≧ 2)

This page was built for publication: Algorithms