On finding the elementary paths of a digraph

Authors

  • Dănuţ Marcu University of Bucharest, Romania
Abstract views: 130

Abstract

Not available.

Downloads

Download data is not yet available.

References

Christofides, Nicos, Graph theory. An algorithmic approach. Computer Science and Applied Mathematics. Academic Press [Harcourt Brace Jovanovich, Publishers], New York-London, 1975. xv+400 pp., MR0429612.

Danielson G.H., On finding the simple paths and circuits in a graph, IEEE Trans., CT-15, 1968.

Dhawan, V., Hamiltonian circuits and related problems in graph theory, M. Sc. Report, Imperial College, London, 1969.

Kaufmann A. et Coster D., Exercices de combinatorique avec solutions (tome II), Dunod, Paris, 1970.

Marcu, Dănuţ, Note on the elementary paths of a digraph. Bul. Univ. Braşov Ser. C 23 (1981), 5-6 (1982), MR0717443.

Marcu, D., Algorithms and Fortran programs for determining circuits and condensated graph of a finite oriented graph (in Romanian), RTTc., 6, 1983.

Marcu, D. Finding the essential ares in a diagraph (in Romanian). St. cerc. calcul economic şi cibernetică economică, 2, 1975.

Roberts, S. M., Flores, Benito, Systematic generation of Hamiltonian circuits. Comm. ACM 9 1966 690-694, MR0195765, https://doi.org/10.1145/365813.365842

Yan, S.S., Generation of all Hamiltonian circuits, paths and centres of a graph and related problems, IEEE Trans., CT-14, 1967, https://doi.org/10.1109/tct.1967.1082662

Downloads

Published

1985-08-01

How to Cite

Marcu, D. (1985). On finding the elementary paths of a digraph. Anal. Numér. Théor. Approx., 14(2), 117–121. Retrieved from https://ictp.acad.ro/jnaat/journal/article/view/1985-vol14-no2-art3

Issue

Vol. 14 No. 2 (1985)

Section

Articles

License

Copyright (c) 2015 Journal of Numerical Analysis and Approximation Theory

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

Open Access. This article is distributed under the terms of the Creative Commons Attribution 4.0 International License, which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.