Nothing Special   »   [go: up one dir, main page]

Skip to main content
Log in

Algorithmus 23 Ein verbesserter Matchingalgorithmus

An improved matching algorithm

  • Algorithmus
  • Published:
Computing Aims and scope Submit manuscript

Zusammenfassung

Der Algorithmus aus [2] ist in der dort gegebenen Formulierung in einem Sonderfall nicht anwendbar. Die neue Formulierung ist allgemein gültig und beinhaltet eine wesentliche Vereinfachung gegenüber [2]. Ein PL/1-Programm wird angegeben.

Abstract

The formulation of the algorithm in [2] does not apply to one special case. The new formulation is generally applicable and contains an essential improvement with regard to [2]. A PL/1 program is added.

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

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Instant access to the full article PDF.

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

Literatur

  1. Berge, C.: Alternating Chain Methods: A Survey. In: Graph Theory and Computing (Read, R. C., Hrsg.). New York: Academic Press 1972.

    Google Scholar 

  2. Dörfler, W., Mühlbacher, J.: Bestimmung eines maximalen Matching in beliebigen Graphen. Computing9, 251–257 (1972).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Dörfler, W., Mühlbacher, J. Algorithmus 23 Ein verbesserter Matchingalgorithmus. Computing 13, 389–397 (1974). https://doi.org/10.1007/BF02241727

Download citation

  • Received:

  • Issue Date:

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

Navigation