• Gabriel Valiente


Trees and graphs count among the most useful mathematical abstractions and, at the same time, the most common combinatorial structures in computer science. Both the graph-theoretical notions underlying algorithms on trees and graphs and appropriate data structures for their representation are the subject of this chapter. Further, a brief primer of the literate programming style adopted in this book for the presentation of algorithms and data structures is included in this chapter, together with a brief exposition of the implementation correctness approach by result checking using correctness certificates. The reader who is not familiar with the LEDA library of efficient C++ data structures and algorithms is referred to Appendix A.


Undirected Graph Complete Bipartite Graph Literate Programming Implementation Correctness Bibliographic Note 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Gabriel Valiente
    • 1
  1. 1.Department of SoftwareTechnical University of CataloniaBarcelonaSpain

Personalised recommendations