Efficient algorithms for finding disjoint paths in grids
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
In Pursuit of Patterns in Data Reasoning from Data The Rough Set Way
TSCTC '02 Proceedings of the Third International Conference on Rough Sets and Current Trends in Computing
Approximating earliest arrival flows with flow-dependent transit times
Discrete Applied Mathematics
Two fast algorithms for all-pairs shortest paths
Computers and Operations Research
Computers and Operations Research
A global router based on a multicommodity flow model
Integration, the VLSI Journal
Flow graphs and decision algorithms
RSFDGrC'03 Proceedings of the 9th international conference on Rough sets, fuzzy sets, data mining, and granular computing
Jump number of two-directional orthogonal ray graphs
IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
Fast and exact network trajectory similarity computation: a case-study on bicycle corridor planning
Proceedings of the 2nd ACM SIGKDD International Workshop on Urban Computing
Hi-index | 0.01 |
In this classic book, first published in 1962, L. R. Ford, Jr., and D. R. Fulkerson set the foundation for the study of network flow problems. The models and algorithms introduced in Flows in Networks are used widely today in the fields of transportation systems, manufacturing, inventory planning, image processing, and Internet traffic. The techniques presented by Ford and Fulkerson spurred the development of powerful computational tools for solving and analyzing network flow models, and also furthered the understanding of linear programming. In addition, the book helped illuminate and unify results in combinatorial mathematics while emphasizing proofs based on computationally efficient construction. Flows in Networks is rich with insights that remain relevant to current research in engineering, management, and other sciences. This landmark work belongs on the bookshelf of every researcher working with networks.