Fundamentals of data structures in PASCAL
Fundamentals of data structures in PASCAL
Algorithms
Analysis of program structure for test input generation in a successive testing environment.
Analysis of program structure for test input generation in a successive testing environment.
Applications of restrictive cutsets and topological CROSS's for minimum total load
ACM-SE 37 Proceedings of the 37th annual Southeast regional conference (CD-ROM)
| Hi-index | 0.00 |
This paper describes a more restrictive definition of cutsets as they are found useful in solving certain problems and presents a reduction method to reduce a flow network (an acyclic weighted digraph) with multiple topological orderings of vertices so that (1) the resulting reduced network has only one topological ordering and (2) the original network and the reduced network have the same maximal cutset. The motivation for such a reduction method is that if a network has only one topological ordering then the maximal cutset can be found in a linear time (linear in terms of the number of arcs).