On finding the simple paths and circuits in a graph
- 1 September 1968
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuit Theory
- Vol. 15 (3) , 294-295
- https://doi.org/10.1109/tct.1968.1082837
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Generation of all Hamiltonian Circuits, Paths, and Centers of a Graph, and Related ProblemsIEEE Transactions on Circuit Theory, 1967
- Pathfinding through a communication networkProceedings of the Institution of Electrical Engineers, 1967
- All paths through a mazeProceedings of the IEEE, 1967
- Computer Recognition and Extraction of Planar Graphs from the Incidence MatrixIEEE Transactions on Circuit Theory, 1966
- Self-Avoiding Paths and the Adjacency Matrix of a GraphSIAM Journal on Applied Mathematics, 1966