Zur bestimmung aller elementarkreise in gerichteten graphen
- 1 January 1978
- journal article
- research article
- Published by Taylor & Francis in Mathematische Operationsforschung und Statistik. Series Optimization
- Vol. 9 (3) , 427-440
- https://doi.org/10.1080/02331937808842508
Abstract
New algorithms for enumerating all circuits of a directed graph are presented. These algorithms are backtrack algorithms, by which we intended to avoid fruitless computations. The best results give algorithms involving heuristic rules. To receive numerical comparisons additionally the algorithms of DÖRFLER/MÜHL-BACHER, TIERNAN/SYSLO and BJELKINA were programmed and tested in FORTRAN (CDC 3300) and (or) ALGOL (ICL 4130).Keywords
This publication has 8 references indexed in Scilit:
- Graphentheorie für InformatikerPublished by Walter de Gruyter GmbH ,1973
- Schnittzahlminimierung in komplexen verfahrenstechnischen SchemataChemical Engineering Science, 1973
- Algorithm 459: the elementary circuits of a graphCommunications of the ACM, 1973
- Enumeration of the Elementary Circuits of a Directed GraphSIAM Journal on Computing, 1973
- Zur bestimmung aller kreise in gerichteten graphenOptimization, 1972
- An efficient search algorithm to find the elementary circuits of a graphCommunications of the ACM, 1970
- The analysis of chemical plant flowsheetsChemical Engineering Science, 1969
- A matrix method for location of cycles of a directed graphAIChE Journal, 1965