Get personalized book recommendations based on your reading history and preferences. Our algorithm analyzes your favorite books and reading patterns to suggest your next great read.

Graph algorithms is a book category focused on methods for modeling and computing on graphs—structures of vertices (nodes) and edges (links) that represent networks. Books in this area cover core problems and techniques such as graph traversal (BFS, DFS), connectivity, shortest paths, minimum spanning trees, flows and cuts, matchings, and colorings, along with correctness proofs and complexity analysis. The category includes foundational textbooks, practical guides with implementations, and advanced monographs on topics like spectral methods, dynamic and distributed graphs, randomized and approximation algorithms, and large-scale/parallel processing. Applications span computer networks and routing, logistics, social and biological networks, cybersecurity, and machine learning, making the category relevant to both theory and practice.

Filter books by their publication year. Enter the earliest year (Start) and latest year (End) to find books published within that period. Leave either field empty to search from the beginning of time or up to the present day.