网络理论及其应用：网络流程NET THEORY AND ITS APPLICATIONS: FLOWS IN NETWORKS
点此进入淘宝搜索页搜索分類: 图书,进口原版书,科学与技术 Science & Techology ,
作者： Wai-Kai Chen著
出 版 社： Penguin
出版时间： 2003-12-1字数：版次： 1页数： 660印刷时间： 2003/05/01开本：印次： 1纸张： 胶版纸I S B N ： 9781860942266包装： 精装编辑推荐
作者简介：
WAI-KAI CHEN is Professor and Head Emeritus of EECS Department, University of Illinois at Chicago. Currently, he is the Vice President of International Technological University. He received his BS and MS from Ohio University, where he became a Distinguished Professor,and PhD from the University of Illinois at Urbana-Champaign.
Professor Chen was Editor of the IEEE Transactions on Circuits and Systems, President of IEEE Circuits and Systems Society and is Founding Editor of Journal of Circuits, Systems and Computers. He received the Lester R Ford Award, Alexander von Humboldt Award, JSPS Fellowship, Ohio University Distinguished Alumni Medal, Senior University Scholar, UIUC Distinguished Alumnus Award, IEEE CAS Golden Jubilee Medal, IEEE CAS Education and Meritorious Service Awards and IEEE Third Millennium Medal.
A fellow of IEEE and AAAS, he is known for his Applied Graph Theory, Theory and Design of Broadband Matching Networks, Active Network and Feedback Amplifier Theory, Passive and Active Filters, and The VLSI Handbook.
内容简介
Electrical, communication, transportation, computer, and neural networks are special kinds of nets. Designing these networks demands sophisticated mathematical models for their analysis. This book is the first to present a unified, comprehensive, and up-to-date treatment of net theory. It brings together elements of abstract graph theory and circuit analysis to network problems.
目录
Preface
1 Graphs and Networks
1.1 Basic Definitions of Abstract Graphs
1.2 Operations on Graphs
1.3 Nonseparable Graphs and Bipartite Graphs
1.4 Planar Graphs
1.5 Dual Graphs
1.6 2-Isomorphism
1.7 Matrices Associated with a Graph
1.7.1 Incidence Matrix
1.7.2 Circuit Matrix
1.7.3 Cut Matrix
1.7.4 Interrelationships Among the Matrices A Bf and Qf
1.7.5 Node-to-Datum Path Matrix
1.8 Directed Graphs
1.8.1 Matrices Associated with a Directed Graph
1.8.2 Interrelationships Among the Matrices
1.8.3 Some Important Classes of Directed Graphs
1.9 The Circuit Matrix Associated with a Planar Graph or Directed Graph
1.10 Summary and Suggested Reading
References
2 The Shortest Directed Path Problem
2.1 Shortest Directed Paths
2.2 Shortest Directed Path Algorithms
2.2.1 Dijkstra Algorithm
2.2.2 Ford-Moore-Bellman Algorithm
2.2.3 Yen Algorithm
2.2.4 Ford-Fulkerson Algorithm
2.3 Multiterminal Shortest Directed Paths
2.3.1 Matrix Algorithm
2.3.2 Floyd-Warshall Algorithm
2.4 Enumeration of the Shortest Directed Paths by Decomposition
2.5 Summary and Suggested Reading
References
3 Maximum Flows in Networks
3.1 Flows
3.2 s-t Cuts
3.3 Maximum Flow
3.4 Ford-Fulkerson Algorithm
3.4.1 Integrity Theorem
3.4.2 Irrational Arc Capacities
3.5 Layered Nets
3.6 A Blocking Flow Algorithm
3.7 Variants of the Ford-Fulkerson Algorithm
3.7.1 Edmonds-Karp Algorithm
3.7.2 Dinic Algorithm
3.7.3 Other Variations
3.8 Karzanov Algorithm
3.9 Flows in Undirected and Mixed Nets
3.10 Flows in Node-and-Arc Capacitated Nets
3.11 Summary and Suggested Reading
References
4 Minimum Trees and Communication Nets
4.1 Forests Subtrees and Trees
4.2 Minimum and Maximum Trees
4.3 Minimum and Maximum Tree Algorithms
4.3.1 Borfivka Algorithm
4.3.2 Kruskal Algorithm
4.3.3 Prim Algorithm
4.3.4 General Remarks
4.4 Terminal Capacity Matrix
……
5 Feasibility Theorems and Their Applications
6 Applecations of Flow Theorems to Subgraph Problems
7 Signal-Flow Graphs
8 Other Net Applications
Index
