Algorithmic mathematics

DOI10.1007/978-3-662-47014-5zbMath1382.68001OpenAlexW4250620569MaRDI QIDQ495037

Stefan Hougardy, Jens Vygen

Publication date: 8 September 2015

Published in: Springer-Lehrbuch (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-47014-5

zbMATH Keywords

algorithmsgraph theoryGauss eliminationmatricesflowstreesC++bipartite matchingbinary searchDijkstra algorithmsorting algorithmsb-adic representation of integersb-adic representation of real numbersmatching on graphspseudocoderepresentation error

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Searching and sorting (68P10) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85) Direct numerical methods for linear systems and matrix inversion (65F05) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to numerical analysis (65-01) Error analysis and interval analysis (65G99) Numerical algorithms for computer arithmetic, etc. (65Y04)

This page was built for publication: Algorithmic mathematics