Ein einfacher Algorithmus, der in einem Graphen einen Kreis mit einer Länge größer als 3 ohne Diagonalen findet
Short Communications
Received:
Revised:
- 23 Downloads
- 1 Citations
Zusammenfassung
Es wird ein einfacher Algorithmus mit den im Titel angegebenen Eigenschaften vor gelegt, der nach höchstensO((n+m)logn) Schritten eine Lösung liefert.
A simple algorithm for finding a cycle of length greater than three and without diagonals
Abstract
A simple algorithm solving the problem of finding a cycle of length greater than three and without diagonals is presented. Given a graph withn vertices andm edges, the algorithm finds a solution after at mostO ((n+m) logn) steps.
Subject Classification numbers
68E 10 (05 C 38)Key words
algorithm nonchordal graph cycle without diagonals Schlüsselwörter Algorithmus nichtchordaler Graph Kreis ohne DiagonalenPreview
Unable to display preview. Download preview PDF.
References
- [1]Aho, A. V., Hopcroft, J. E., Ullman, J. D.: The design and analysis of computer algorithms. Reading, Mass.: Addison-Wesley 1974.Google Scholar
- [2]Booth, K. S., Lueker, G. S.: Testing for the consecutive ones property, interval graphs and graph planarity using PQ-algorithms. J. Comp. System Sci.13, 335–379 (1976).Google Scholar
- [3]Itai, A., Rodeh, M.: Finding a minimum circuit in a graph. SIAM J. Compt.7, 413–424 (1978).CrossRefGoogle Scholar
- [4]Lipski, W.: Information storage and retrieval—mathematical foundations II (Combinatorial problems). Theoret. Comput. Sci.3, 183–211 (1976).CrossRefGoogle Scholar
- [5]Rose, D. J.: Triangulated graphs and the elimination process. J. Math. Anal. Appl.32, 597–609 (1970).Google Scholar
Copyright information
© Springer-Verlag 1981