## 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 | |

24 other sections not shown

### Other editions - View all

### Common terms and phrases

adjacent algorithm analysis arcs ARPA ARPANET assignment augmenting path average branches calculation capacity circuit communication component computer networks connected consider constraints constructed corresponding cost function cutsets deﬁned degree denote diameter directed graph disconnected disconnecting set Euler tour example ﬁnd ﬁnding ﬁrst flow given graph G graph theory Hamiltonian cycle heuristic IEEE Trans integer interlacing iteration labeled Lemma length locally optimum matrix maximally maximum ﬂow method minimal minimum cost minimum number modiﬁcation n-connected network design node pairs number of edges number of nodes obtained operation optimal optimum packet pair of nodes partition problem procedure proof reliability remote concentrator routing s-t cut sequence shortest path shown solution speciﬁed star polygon Step strongly connected component structure subgraph subnetwork subsets Telpak terminal Theorem throughput tion topology tour traffic transmission traveling salesman problem tree vector vertex vertices