Algorithms on Graphs

  • Kurt Mehlhorn
Part of the EATCS Monographs on Theoretical Computer Science book series (EATCS, volume 2)

Abstract

In this chapter we treat efficient algorithms for many basic problems on graphs: topological sorting and transitive closure, connectivity and biconnectivity, least cost paths, least cost spanning trees, network flow problems and matching problems and planarity testing.

Keywords

Sorting Paral Prefix Suffix Onlye Element 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1984

Authors and Affiliations

  • Kurt Mehlhorn
    • 1
  1. 1.FB 10, Angewandte Mathematik und InformatikUniversität des SaarlandesSaarbrückenGermany

Personalised recommendations