Algorithms on trees and graphs : with python code

Author(s)

    • Valiente, Gabriel

Bibliographic Information

Algorithms on trees and graphs : with python code

Gabriel Valiente

(Texts in computer science)

Springer, c2021

2nd ed

Available at  / 2 libraries

Search this Book/Journal

Description and Table of Contents

Description

Graph algorithms is a well-established subject in mathematics and computer science. Beyond classical application fields, such as approximation, combinatorial optimization, graphics, and operations research, graph algorithms have recently attracted increased attention from computational molecular biology and computational chemistry. Centered around the fundamental issue of graph isomorphism, this text goes beyond classical graph problems of shortest paths, spanning trees, flows in networks, and matchings in bipartite graphs. Advanced algorithmic results and techniques of practical relevance are presented in a coherent and consolidated way. This book introduces graph algorithms on an intuitive basis followed by a detailed exposition in a literate programming style, with correctness proofs as well as worst-case analyses. Furthermore, full C++ implementations of all algorithms presented are given using the LEDA library of efficient data structures and algorithms.

Table of Contents

1. Introduction.- 2. Algorithmic Techniques.- 3. Tree Traversal.- 4. Tree Isomorphism.- 5. Graph Traversal.- 6. Clique, Independent Set, and Vertex Cover.- 7. Graph Isomorphism.

by "Nielsen BookData"

Related Books: 1-1 of 1

Details

  • NCID
    BC16120418
  • ISBN
    • 9783030818845
  • Country Code
    sz
  • Title Language Code
    eng
  • Text Language Code
    eng
  • Place of Publication
    Cham
  • Pages/Volumes
    xv, 386 p.
  • Size
    25 cm
  • Classification
  • Subject Headings
  • Parent Bibliography ID
Page Top