## Large-scale networks, theory and design |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

Optimum Path Problems R E Thomas October 1975 | 11 |

Network Analysis H Frank and I T Frisch Scientific American July 1970 | 19 |

An Appraisal of Some ShortestPath Algorithms S E Dreyfus Operations Research MayJune 1969 | 28 |

Copyright | |

22 other sections not shown

### Other editions - View all

### Common terms and phrases

adjacent analysis arcs ARPA ARPANET assignment augmenting path average branches buffers calculation capacity channel circuit communication component computer networks concentrator consider constraints constructed corresponding cost function cutsets defined degree denote depth-first search diameter directed graph disconnected disconnecting set example flow problem given graph G graph theory Hamiltonian cycle heuristic IEEE Trans integer interface iteration labeled Lemma length locally optimum matrix max-flow min-cut theorem maximally maximum flow method minimal minimum cost minimum number n-connected network design node disjoint paths node pairs node-disjoint number of edges number of nodes obtained operation optimal optimum packet pair of nodes partition procedure Proof reliability remote concentrator routing s-t cuts sequence shortest path shown solution specified Step strongly connected component structure subgraph subnetwork subsets Telpak terminal Theorem throughput tion topology tour traffic transmission tree TYMNET vector vertex vertices