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.
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.
This is a preview of subscription content, log in via an institution to check access.
References
Aho, A. V., Hopcroft, J. E., Ullman, J. D.: The design and analysis of computer algorithms. Reading, Mass.: Addison-Wesley 1974.
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).
Itai, A., Rodeh, M.: Finding a minimum circuit in a graph. SIAM J. Compt.7, 413–424 (1978).
Lipski, W.: Information storage and retrieval—mathematical foundations II (Combinatorial problems). Theoret. Comput. Sci.3, 183–211 (1976).
Rose, D. J.: Triangulated graphs and the elimination process. J. Math. Anal. Appl.32, 597–609 (1970).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Truszezyński, M. A simple algorithm for finding a cycle of length greater than three and without diagonals. Computing 27, 89–91 (1981). https://doi.org/10.1007/BF02243441
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02243441