Networks and algorithms : an introductory approach
Author(s)
Bibliographic Information
Networks and algorithms : an introductory approach
J. Wiley & Sons, 1993
- : cloth
- : paper
Available at 35 libraries
  Aomori
  Iwate
  Miyagi
  Akita
  Yamagata
  Fukushima
  Ibaraki
  Tochigi
  Gunma
  Saitama
  Chiba
  Tokyo
  Kanagawa
  Niigata
  Toyama
  Ishikawa
  Fukui
  Yamanashi
  Nagano
  Gifu
  Shizuoka
  Aichi
  Mie
  Shiga
  Kyoto
  Osaka
  Hyogo
  Nara
  Wakayama
  Tottori
  Shimane
  Okayama
  Hiroshima
  Yamaguchi
  Tokushima
  Kagawa
  Ehime
  Kochi
  Fukuoka
  Saga
  Nagasaki
  Kumamoto
  Oita
  Miyazaki
  Kagoshima
  Okinawa
  Korea
  China
  Thailand
  United Kingdom
  Germany
  Switzerland
  France
  Belgium
  Netherlands
  Sweden
  Norway
  United States of America
Note
Includes index
Description and Table of Contents
- Volume
-
: cloth ISBN 9780471939924
Description
Network theory has become a valuable aid to analysis techniques used in industry, commerce and government. This undergraduate introduction to the subject explores all aspects, arranging material in such a way that students can apply the information gleaned to independent study.
Table of Contents
- Graphs and Digraphs
- Flows in Basic Networks
- Variations on the Basic Flow Problem
- Multi-Terminal Flows
- Paths and Connectivity
- Longest and Shortest Path Algorithms
- Trees
- Physical Networks: Modeling
- Electrical Networks: Matrix Equations
- Electrical Networks: Solving the Equations
- Matching Problems
- The Assignment Problem
- The Transportation Problem
- Critical Path Analysis
- Scheduling
- Packing Problems
- Location Problems
- Theory of Network Analysis
- Algorithms and NP-Completeness
- Suggestions for Further Reading
- Solutions to Problems in the Text
- Index.
- Volume
-
: paper ISBN 9780471939931
Description
Network theory has become a valuable aid to analysis techniques used in industry, commerce and government. This undergraduate introduction to the subject explores all aspects, arranging material in such a way that students can apply the information gleaned to independent study.
Table of Contents
- Flows in Basic Networks
- Variations on the Basic Flow Problem
- Multi-Terminal Flows
- Paths and Connectivity
- Longest and Shortest Path Algorithms
- Trees
- Physical Networks: Modelling
- Electrical Networks
- Matrix Equations
- Electrical Networks: Solving the Network Equations
- Matching Problems
- The Assignment Problem
- The Transportation Problem
- Critical Path Analysis
- Scheduling
- Packing Problems
- Location Problems
- Theory of Network Analysis
- Algorithms and NP-Completeness
- Solutions to Problems in the Text.
by "Nielsen BookData"