Algorithms in Java, Part 5: Graph Algorithms

Authors:
Robert Sedgewick;Michael Schidlowsky
Affiliations:
-;-
Venue:
Algorithms in Java, Part 5: Graph Algorithms
Year:
2003

Citing 0
Cited 12

List processing: sort again, naturally

ACM SIGCSE Bulletin
A focus program for data structures and algorithm design

Journal of Computing Sciences in Colleges
Synthesizing service composition models on the basis of temporal business rules

Journal of Computer Science and Technology
A decomposition algorithm for learning Bayesian network structures from data

PAKDD'08 Proceedings of the 12th Pacific-Asia conference on Advances in knowledge discovery and data mining
Combining discrete SVM and fixed cardinality warping distances for multivariate time series classification

Pattern Recognition
Structured testing using ant colony optimization

Proceedings of the First International Conference on Intelligent Interactive Technologies and Multimedia
Agent-based computing from multi-agent systems to agent-based models: a visual survey

Scientometrics
A formal model of obfuscation and negotiation for location privacy

PERVASIVE'05 Proceedings of the Third international conference on Pervasive Computing
Combination of conditional Monte Carlo and approximate zero-variance importance sampling for network reliability estimation

Proceedings of the Winter Simulation Conference
Model-based tool support for consistent three-way merging of EMF models

Proceedings of the workshop on ACadeMics Tooling with Eclipse
Structure and spatial consistency of network-based space layouts for building and product design

Computer-Aided Design
A graph theory-based approach to route location in railway interlocking

Computers and Industrial Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

From the Publisher:Once again, Robert Sedgewick provides a current and comprehensive introduction to important algorithms. The focus this time is on graph algorithms, which are increasingly critical for a wide range of applications, such as network connectivity, circuit design, scheduling, transaction processing, and resource allocation. In this book, Sedgewick offers the same successful blend of theory and practice that has made his work popular with programmers for many years. Michael Schidlowsky and Sedgewick have developed concise new Java implementations that both express the methods in a natural and direct manner and also can be used in real applications.Algorithms in Java, Third Edition, Part 5: Graph Algorithms is the second book in Sedgewick's thoroughly revised and rewritten series. The first book, Parts 1-4, addresses fundamental algorithms, data structures, sorting, and searching. A forthcoming third book will focus on strings, geometry, and a range of advanced algorithms. Each book's expanded coverage features new algorithms and implementations, enhanced descriptions and diagrams, and a wealth of new exercises for polishing skills. The natural match between Java classes and abstract data type (ADT) implementations makes the code more broadly useful and relevant for the modern object-oriented programming environment.