Practical analysis of algorithms

DOI10.1007/978-3-319-09888-3zbMath1303.68007OpenAlexW633975478MaRDI QIDQ461086

Dana Vrajitoru, William J. Knight

Publication date: 9 October 2014

Published in: Undergraduate Topics in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-09888-3

zbMATH Keywords

recurrence relationsalgorithm analysisfinite graph algorithms

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Searching and sorting (68P10) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05) Randomized algorithms (68W20) General topics in the theory of algorithms (68W01)

Related Items (1)

ON THE MAXIMUM NUMBER OF PERIOD ANNULI FOR SECOND ORDER CONSERVATIVE EQUATIONS

This page was built for publication: Practical analysis of algorithms