论文信息 - Flows ! - 字舞流文

Flows !

Some tools used in Combinatorics of Words allow the profiling of “divide and conquer” algorithms in a number of Operational Research fields, like database management, automatic translation, image pattern recognition, flowing or shortest path problems. . . . This paper details one of them, the maximization of a flow over a network.

[1] D. R. Fulkerson,et al. Maximal Flow Through a Network , 1956 .

[2] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[3] Richard M. Karp,et al. Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems , 1972, Combinatorial Optimization.

[4] Bruce W. Weide,et al. A Survey of Analysis Techniques for Discrete Algorithms , 1977, CSUR.

[5] Donald B. Johnson,et al. Efficient Algorithms for Shortest Paths in Sparse Networks , 1977, J. ACM.

[6] Dimitri P. Bertsekas,et al. Data Networks , 1986 .

[7] David K. Smith. Network Flows: Theory, Algorithms, and Applications , 1994 .

[8] Ron Widyono. The Design and Evaluation of Routing Algorithms for Real-time Channels , 1994 .

[9] Evaluation of Multicast Routing Algorithms for Real-Time Communication on High-Speed Networks , 1997, IEEE J. Sel. Areas Commun..

[10] John Crawford,et al. Low Cost Quality of Service Multicast Routing in High Speed Networks , 1997 .

[11] Bert Gerards,et al. The Excluded Minors for GF(4)-Representable Matroids , 1997, J. Comb. Theory, Ser. B.

[12] Michel Koskas. a Hierarchical Database Manager , 2004 .