A method for obtaining the maximum multiroute flows in a network

Networks

Volumn 27, Issue 4, 1996, Pages 279-291

  Kishimoto, Wataru ^a  

^a TAMAGAWA UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0040063766     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-0037(199607)27:4<279::AID-NET3>3.0.CO;2-D     Document Type: Article

References (12)

1. N. L. Biggs, E. K. Lloyd, and R. J. Wilson, Graph Theory 1736-1936, Clarendon Press, Oxford (1976).
2. W. K. Chen, Theory of Nets: Flows in Networks, Wiley, (1990).
3. Y. Egawa, A. Kaneko, and M. Matsumoto, A mixed version of Menger's theorem. Combinatorica 11 (1) (1991) 71-74.
4. H. Nagamochi and T. Ibaraki, Linear-time algorithms for finding a sparse k-connected spanning subgraph of a k-connected graph. Algorithmica 7 (1992) 583-596.
5. L. R. Ford, Jr. and D. R. Fulkerson, Flows in Networks. Princeton University Press, Princeton, NJ (1962).
6. W. Kishimoto and M. Takeuchi, On Two-Route Flows in an Undirected Network. IEICE Technical Report, CAS90-19. DSP90-23 (1990) (in Japanese).
7. W. Kishimoto, M. Takeuchi, and G. Kishi, Two-route flows in an undirected flow network. IEICE Trans. J-75-A (11) (1992) 1699-1717 (in Japanese).
8. W. Kishimoto and M. Takeuchi, On m-route flows in a network. IEICE Trans. J-76-A(8) (1993) 1185-1200 (in Japanese).
9. D. König, Über Graphen und ihre Anwendung auf Determinantentheorie und Mengenlehre. Math. Ann. 77 (1916) 453-465.
10. D. König, Theorie der endlichen und unendlichen Graphen. Chelsea, New York (1950).
11. B. Korte, L. Lovász, H. J. Prömel, and A. Schrijver, Paths. Flows, and VLSI-Layout. Springer-Verlag. Berlin/Heidelberg/New York (1990).
12. H. Ozaki and I. Shirakawa, Theory of Graphs and Networks Corona, Tokyo (1973) (in Japanese).