On Finding the Paths Through a Network
- 1 February 1972
- journal article
- website
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Bell System Technical Journal
- Vol. 51 (2) , 371-390
- https://doi.org/10.1002/j.1538-7305.1972.tb01925.x
Abstract
Given a directed graph G, algorithms are discussed for finding (i) all paths through G with prescribed originating and terminating nodes, (ii) a subset of these paths containing all the edges, (iii) a subset containing all the edge-edge transitions, ...Keywords
This publication has 13 references indexed in Scilit:
- Simplification of the Covering Problem with Application to Boolean ExpressionsJournal of the ACM, 1970
- Shortest Paths in Probabilistic GraphsOperations Research, 1969
- Computer Solutions to Minimum-Cover ProblemsOperations Research, 1969
- An Appraisal of Some Shortest-Path AlgorithmsOperations Research, 1969
- Recent Advances in Network FlowsSIAM Review, 1968
- On finding optimal coversInternational Journal of Computer Mathematics, 1968
- Integer Programming by Implicit Enumeration and Balas’ MethodSIAM Review, 1967
- Covering Problems: Duality Relations and a New Method of SolutionSIAM Journal on Applied Mathematics, 1966
- Systems of representativesJournal of Mathematical Analysis and Applications, 1966
- Flow Networks and Combinatorial Operations ResearchThe American Mathematical Monthly, 1966