Abstract
Combinatorial problems on trees and graphs can be studied in the general framework of assigning values to nodes or vertices in such a way that some specified constraints are satisfied. Some of the basic algorithmic techniques for solving these problems—backtracking, branch-and-bound, divide-and-conquer, and dynamic programming—are presented in this chapter, and they are illustrated by the problem of computing the edit distance between two trees.
For decades, computer scientists have focused attention on problems that admit efficient algorithms. Algorithms whose running time grows no faster than some polynomial of low degree in the size of the input data still dominate textbooks on algorithms.
—Jürg Nievergelt [247]
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Valiente, G. (2002). Algorithmic Techniques. In: Algorithms on Trees and Graphs. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-04921-1_2
Download citation
DOI: https://doi.org/10.1007/978-3-662-04921-1_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-07809-5
Online ISBN: 978-3-662-04921-1
eBook Packages: Springer Book Archive