Skip to main content

Pruning and depth first search

  • 1436 Accesses

Part of the Lecture Notes in Mathematics book series (LNM,volume 642)

Abstract

This paper contrasts two algorithms for finding a fundamental set of cycles for a connected graph. The first algorithm based on a PRUNING technique is known to have complexity 0(β(G)|V|2). The second algorithm based on a DEPTH FIRST SEARCH is shown to have complexity 0(β(G)|V|).

Keywords

  • Span Tree
  • Random Graph
  • Incidence Matrix
  • Depth First Search
  • Pruning Technique

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.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   44.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   59.00
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Aho, J. Hopcroft and J. Ullman. The Design and Analysis of Computer Algorithms. Addison Wesley, Reading, Mass. (1974).

    MATH  Google Scholar 

  2. M. Behzad and G. Chartrand. Introduction to the Theory of Graphs. Allyn and Bacon, Boston (1962).

    Google Scholar 

  3. C. Gotlieb and D. Cornell, Algorithms for finding a fundamental set of cycles for an undirected linear graph. Comm. ACM 10 (1967), 780–783.

    CrossRef  MATH  Google Scholar 

  4. J. Hopcroft and R. Tarjan. Efficient algorithms for graph manipulation (Algorithm 447). Comm. ACM 16 (1973), 372–378.

    CrossRef  Google Scholar 

  5. A. Nijenhuis and H. Wilf. Combinatorial Algorithms. Academic Press, New York (1975).

    MATH  Google Scholar 

  6. R. Read. Teaching Graph Theory to a Computer, Recent Progress in Combinatorics. Academic Press, New York (1969).

    Google Scholar 

  7. R. Tarjan. Depth first search and linear graph algorithms. Siam J. Comput. 1 (1972), 146–160.

    CrossRef  MathSciNet  MATH  Google Scholar 

  8. G. Tarry. Le probleme des labyrinthes. Nouvelles Ann. de Math. 14 (1895), 187.

    Google Scholar 

  9. L. Weinberg. Network Analysis and Synthesis. McGraw-Hill, New York (1962).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1978 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Haggard, G. (1978). Pruning and depth first search. In: Alavi, Y., Lick, D.R. (eds) Theory and Applications of Graphs. Lecture Notes in Mathematics, vol 642. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0070379

Download citation

  • DOI: https://doi.org/10.1007/BFb0070379

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-08666-6

  • Online ISBN: 978-3-540-35912-8

  • eBook Packages: Springer Book Archive