Skip to main content
SpringerLink
Log in

A remark on the time complexity of the subtree problem

  • Published:
Computing Aims and scope Submit manuscript

Abstract

In the present paper it is shown that the subtree problem may be solved in the general case in time 0 (n 2.5) and in the case of bounded degree in time 0 (n 2) (n denotes the length of the input).

Zusammenfassung

In der vorliegenden Arbeit wird gezeigt, daß das Teilbaumproblem im allgemeinen Fall in der Zeit 0 (n 2.5) und bei beschränktem Knotengrad in der Zeit 0 (n 2) gelöst werden kann (n sei die Länge der Eingabe).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Aho, A. V., Hopcroft, J. E., Ullman, J. D.: The Design and Analysis of Computer Algorithms. Reading: Addison-Wesley 1974.

    Google Scholar 

  2. Edmonds, J.: Paths, Trees, and Flowers. Canadian J.17, 449–467 (1965).

    Google Scholar 

  3. Even, S., Kariv, O.: An 0 (N 2.5) Algorithm for Maximum Matching in General Graphs, in: 16th Annual Symp. on Found. of Comp. Science. Oct. 1975, IEEE, pp. 100–112.

  4. Fontet, M.: A Linear Algorithm for Testing Isomorphism of Planar Graphs. 3rd Int. Col. Aut. Lang. and Prog., Edinburgh (1976), pp. 411–424.

  5. Gabov, H.: An Efficient Implementation of Edmonds' Maximum Matching Algorithm. TR Stan-CS31, 72–328 (1972).

    Google Scholar 

  6. Garey, M. R., Johnson, D. S., Stockmeyer, L.: Some Simplified NP-Complete Problems. ACM SIGACT News6, 47–63 (1974).

    Google Scholar 

  7. Harper, L. H., Savage, J. E.: On the Complexity of the Marriage Problem. Adv. in Math.9, 299 to 312 (1972).

    Google Scholar 

  8. Hopcroft, J. E., Karp, R. M.: Ann 5/2-Algorithm for Maximum Matching in Bipartite Graphs. SIAM J. on Comp.2, 225–231 (1973).

    Google Scholar 

  9. Hopcroft, J. E., Tarjan, R. E.: AV logV Algorithm for Isomorphism of Triconnected Planar Graphs. J. Comp. Syst. Science7, 323–331 (1973).

    Google Scholar 

  10. Hopcroft, J. E., Tarjan, R. E.: Isomorphism of Planar Graphs (working paper), in: Complexity of Computer Computations (Miller, R. E., Thatcher, J. W., eds.), pp. 143–150. New York: Plenum Press 1972.

    Google Scholar 

  11. Hopcroft, J. E., Wong, J. K.: Linear Time Algorithm for Isomorphism of Planar Graphs. ACM SICACT News6, 172–184 (1974).

    Google Scholar 

  12. Stadel, M.: Bemerkungen zur Zeitkomplexität des Teilbaumproblems. Paper given at the WG 77 conference in Linz, 1977.

  13. Weinberg, L.: A Simple and Efficient Algorithm for Determining Isomorphism of Planar Triply Connected Graphs. IEEE Trans. on Circuit Theory13, 142–148 (1966).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich 10, Universität des Saarlandes, D-6600, Saarbrücken, Federal Republic of Germany

    M. Stadel

Authors
  1. M. Stadel
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Stadel, M. A remark on the time complexity of the subtree problem. Computing 19, 297–302 (1978). https://doi.org/10.1007/BF02252027

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation