Algorithms
From MaRDI portal
Publication:5905704
DOI10.1016/0001-8708(75)90153-XzbMath0301.68050MaRDI QIDQ5905704
Publication date: 1975
Published in: Advances in Mathematics (Search for Journal in Brave)
68W99: Algorithms in computer science
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)