Net theory and its applications :: flows in networks /
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 tog...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
London :
Imperial College Press,
2003.
|
| Schriftenreihe: | Series in electrical and computer engineering ;
vol. 1. |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Zusammenfassung: | 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. |
| Beschreibung: | 1 online resource (x, 660 pages) : illustrations |
| Bibliographie: | Includes bibliographical references and index. |
| ISBN: | 9781848161290 1848161298 1281865907 9781281865908 9786611865900 661186590X |
Internformat
MARC
| LEADER | 00000cam a2200000 a 4500 | ||
|---|---|---|---|
| 001 | ZDB-4-EBA-ocn261127898 | ||
| 003 | OCoLC | ||
| 005 | 20241004212047.0 | ||
| 006 | m o d | ||
| 007 | cr cnu---unuuu | ||
| 008 | 081007s2003 enka ob 001 0 eng d | ||
| 040 | |a N$T |b eng |e pn |c N$T |d OCLCQ |d UBY |d IDEBK |d E7B |d OCLCQ |d OCLCF |d NLGGC |d OCLCO |d YDXCP |d OCLCQ |d VTS |d AGLDB |d STF |d M8D |d UKAHL |d LEAUB |d VLY |d OCLCO |d OCLCQ |d OCL |d OCLCO |d OCLCL |d SXB |d OCLCQ |d OCLCO |d OCLCQ | ||
| 019 | |a 505142797 |a 646768420 |a 1086506927 |a 1162014656 |a 1241943713 |a 1300664776 | ||
| 020 | |a 9781848161290 |q (electronic bk.) | ||
| 020 | |a 1848161298 |q (electronic bk.) | ||
| 020 | |a 1281865907 | ||
| 020 | |a 9781281865908 | ||
| 020 | |a 9786611865900 | ||
| 020 | |a 661186590X | ||
| 020 | |z 1860942261 | ||
| 020 | |z 9781860942266 | ||
| 035 | |a (OCoLC)261127898 |z (OCoLC)505142797 |z (OCoLC)646768420 |z (OCoLC)1086506927 |z (OCoLC)1162014656 |z (OCoLC)1241943713 |z (OCoLC)1300664776 | ||
| 050 | 4 | |a TK3226 |b .C467 2003eb | |
| 072 | 7 | |a MAT |x 016000 |2 bisacsh | |
| 072 | 7 | |a MAT |x 018000 |2 bisacsh | |
| 082 | 7 | |a 511.3 |2 22 | |
| 049 | |a MAIN | ||
| 100 | 1 | |a Chen, Wai-Kai, |d 1936- |1 https://id.oclc.org/worldcat/entity/E39PBJyCCHRrC93Wrwjfkyvj4q |0 http://id.loc.gov/authorities/names/n50059490 | |
| 245 | 1 | 0 | |a Net theory and its applications : |b flows in networks / |c Wai-Kai Chen. |
| 260 | |a London : |b Imperial College Press, |c 2003. | ||
| 300 | |a 1 online resource (x, 660 pages) : |b illustrations | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 490 | 1 | |a Series in electrical and computer engineering ; |v vol. 1 | |
| 504 | |a Includes bibliographical references and index. | ||
| 588 | 0 | |a Print version record. | |
| 505 | 0 | |a 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.8. Directed graphs. 1.9. The circuit matrix associated with a planar graph or directed graph. 1.10. Summary and suggested reading -- 2. The shortest directed path problem. 2.1. Shortest directed paths. 2.2. Shortest directed path algorithms. 2.3. Multiterminal shortest directed paths. 2.4. Enumeration of the shortest directed paths by decomposition. 2.5. Summary and suggested reading -- 3. Maximum flows in networks. 3.1. Flows. 3.2. s-t cuts. 3.3. Maximum flow. 3.4. Ford-Fulkerson algorithm. 3.5. Layered nets. 3.6. A blocking flow algorithm. 3.7. Variants of the Ford-Fulkerson algorithm. 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 -- 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.4. Terminal capacity matrix. 4.5. Synthesis of a flow-equivalent tree. 4.6. Synthesis of optimum undirected communication nets. 4.7. Oriented communication nets. 4.8. Summary and suggested reading -- 5. Feasibility theorems and their applications. 5.1. A supply-demand theorem. 5.2. An extended supply-demand theorem. 5.3. Circulation theorem. 5.4. Feasible circulation algorithm. 5.5. Flows in nets with lower bounds on arcs. 5.6. Feasible flows in node-and-arc capacitated nets. 5.7. Summary and suggested reading -- 6. Applications of flow theorems to subgraph problems. 6.1. The subgraph problem of a directed graph. 6.2. Digraphic sequences. 6.3. The subgraph problem of a graph. 6.4. Graphical sequences. 6.5. The (p, s)-matrix. 6.6. Realization of the 1-matrix and the (1, 0)-matrix. 6.7. Minimal transformations. 6.8. Summary and suggested reading -- 7. Signal-flow graphs. 7.1. The signal-flow graph. 7.2. Topological evaluation of determinants. 7.3. Topological evaluation of cofactors. 7.4. Topological solutions of linear algebraic equations. 7.5. Equivalence and transformation. 7.6. The matrix inversion. 7.7. Signal-flow graph formulation of feedback amplifier theory. 7.8. Matrix signal-flow graph. 7.9. The multiple-loop feedback amplifier theory. 7.10. Summary and suggested reading -- 8. Other net applications. 8.1. Boolean matrices and switching nets. 8.2. Tellegen's theorem. 8.3. Generalized signal-flow graphs. 8.4. Permutations by spaghetti Amida. 8.5. The Amida graph. 8.6. Graph decomposition and hybrid analysis of electrical networks. 8.7. Summary and suggested reading. | |
| 520 | |a 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. | ||
| 546 | |a English. | ||
| 650 | 0 | |a Machine theory. |0 http://id.loc.gov/authorities/subjects/sh85079341 | |
| 650 | 0 | |a Nets (Mathematics) |0 http://id.loc.gov/authorities/subjects/sh85091044 | |
| 650 | 0 | |a Flowgraphs. |0 http://id.loc.gov/authorities/subjects/sh85049350 | |
| 650 | 0 | |a System analysis. |0 http://id.loc.gov/authorities/subjects/sh85131733 | |
| 650 | 2 | |a Systems Analysis |0 https://id.nlm.nih.gov/mesh/D013597 | |
| 650 | 6 | |a Réseaux (Mathématiques) | |
| 650 | 6 | |a Graphes de fluence. | |
| 650 | 6 | |a Analyse de systèmes. | |
| 650 | 6 | |a Théorie des automates. | |
| 650 | 7 | |a systems analysis. |2 aat | |
| 650 | 7 | |a MATHEMATICS |x Infinity. |2 bisacsh | |
| 650 | 7 | |a MATHEMATICS |x Logic. |2 bisacsh | |
| 650 | 7 | |a System analysis |2 fast | |
| 650 | 7 | |a Nets (Mathematics) |2 fast | |
| 650 | 7 | |a Flowgraphs |2 fast | |
| 650 | 7 | |a Machine theory |2 fast | |
| 776 | 0 | 8 | |i Print version: |a Chen, Wai-Kai, 1936- |t Net theory and its applications. |d London : Imperial College Press, 2003 |z 1860942261 |z 9781860942266 |w (DLC) 2005281859 |w (OCoLC)52785429 |
| 830 | 0 | |a Series in electrical and computer engineering ; |v vol. 1. |0 http://id.loc.gov/authorities/names/no2003123710 | |
| 856 | 4 | 0 | |l FWS01 |p ZDB-4-EBA |q FWS_PDA_EBA |u https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=235547 |3 Volltext |
| 938 | |a Askews and Holts Library Services |b ASKH |n AH24682547 | ||
| 938 | |a ebrary |b EBRY |n ebr10255584 | ||
| 938 | |a EBSCOhost |b EBSC |n 235547 | ||
| 938 | |a YBP Library Services |b YANK |n 2889004 | ||
| 994 | |a 92 |b GEBAY | ||
| 912 | |a ZDB-4-EBA | ||
| 049 | |a DE-863 | ||
Datensatz im Suchindex
| DE-BY-FWS_katkey | ZDB-4-EBA-ocn261127898 |
|---|---|
| _version_ | 1816881678581235712 |
| adam_text | |
| any_adam_object | |
| author | Chen, Wai-Kai, 1936- |
| author_GND | http://id.loc.gov/authorities/names/n50059490 |
| author_facet | Chen, Wai-Kai, 1936- |
| author_role | |
| author_sort | Chen, Wai-Kai, 1936- |
| author_variant | w k c wkc |
| building | Verbundindex |
| bvnumber | localFWS |
| callnumber-first | T - Technology |
| callnumber-label | TK3226 |
| callnumber-raw | TK3226 .C467 2003eb |
| callnumber-search | TK3226 .C467 2003eb |
| callnumber-sort | TK 43226 C467 42003EB |
| callnumber-subject | TK - Electrical and Nuclear Engineering |
| collection | ZDB-4-EBA |
| contents | 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.8. Directed graphs. 1.9. The circuit matrix associated with a planar graph or directed graph. 1.10. Summary and suggested reading -- 2. The shortest directed path problem. 2.1. Shortest directed paths. 2.2. Shortest directed path algorithms. 2.3. Multiterminal shortest directed paths. 2.4. Enumeration of the shortest directed paths by decomposition. 2.5. Summary and suggested reading -- 3. Maximum flows in networks. 3.1. Flows. 3.2. s-t cuts. 3.3. Maximum flow. 3.4. Ford-Fulkerson algorithm. 3.5. Layered nets. 3.6. A blocking flow algorithm. 3.7. Variants of the Ford-Fulkerson algorithm. 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 -- 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.4. Terminal capacity matrix. 4.5. Synthesis of a flow-equivalent tree. 4.6. Synthesis of optimum undirected communication nets. 4.7. Oriented communication nets. 4.8. Summary and suggested reading -- 5. Feasibility theorems and their applications. 5.1. A supply-demand theorem. 5.2. An extended supply-demand theorem. 5.3. Circulation theorem. 5.4. Feasible circulation algorithm. 5.5. Flows in nets with lower bounds on arcs. 5.6. Feasible flows in node-and-arc capacitated nets. 5.7. Summary and suggested reading -- 6. Applications of flow theorems to subgraph problems. 6.1. The subgraph problem of a directed graph. 6.2. Digraphic sequences. 6.3. The subgraph problem of a graph. 6.4. Graphical sequences. 6.5. The (p, s)-matrix. 6.6. Realization of the 1-matrix and the (1, 0)-matrix. 6.7. Minimal transformations. 6.8. Summary and suggested reading -- 7. Signal-flow graphs. 7.1. The signal-flow graph. 7.2. Topological evaluation of determinants. 7.3. Topological evaluation of cofactors. 7.4. Topological solutions of linear algebraic equations. 7.5. Equivalence and transformation. 7.6. The matrix inversion. 7.7. Signal-flow graph formulation of feedback amplifier theory. 7.8. Matrix signal-flow graph. 7.9. The multiple-loop feedback amplifier theory. 7.10. Summary and suggested reading -- 8. Other net applications. 8.1. Boolean matrices and switching nets. 8.2. Tellegen's theorem. 8.3. Generalized signal-flow graphs. 8.4. Permutations by spaghetti Amida. 8.5. The Amida graph. 8.6. Graph decomposition and hybrid analysis of electrical networks. 8.7. Summary and suggested reading. |
| ctrlnum | (OCoLC)261127898 |
| dewey-full | 511.3 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511.3 |
| dewey-search | 511.3 |
| dewey-sort | 3511.3 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>06373cam a2200733 a 4500</leader><controlfield tag="001">ZDB-4-EBA-ocn261127898</controlfield><controlfield tag="003">OCoLC</controlfield><controlfield tag="005">20241004212047.0</controlfield><controlfield tag="006">m o d </controlfield><controlfield tag="007">cr cnu---unuuu</controlfield><controlfield tag="008">081007s2003 enka ob 001 0 eng d</controlfield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">N$T</subfield><subfield code="b">eng</subfield><subfield code="e">pn</subfield><subfield code="c">N$T</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">UBY</subfield><subfield code="d">IDEBK</subfield><subfield code="d">E7B</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCF</subfield><subfield code="d">NLGGC</subfield><subfield code="d">OCLCO</subfield><subfield code="d">YDXCP</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">VTS</subfield><subfield code="d">AGLDB</subfield><subfield code="d">STF</subfield><subfield code="d">M8D</subfield><subfield code="d">UKAHL</subfield><subfield code="d">LEAUB</subfield><subfield code="d">VLY</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCL</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCL</subfield><subfield code="d">SXB</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCQ</subfield></datafield><datafield tag="019" ind1=" " ind2=" "><subfield code="a">505142797</subfield><subfield code="a">646768420</subfield><subfield code="a">1086506927</subfield><subfield code="a">1162014656</subfield><subfield code="a">1241943713</subfield><subfield code="a">1300664776</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781848161290</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1848161298</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1281865907</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781281865908</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9786611865900</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">661186590X</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">1860942261</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">9781860942266</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)261127898</subfield><subfield code="z">(OCoLC)505142797</subfield><subfield code="z">(OCoLC)646768420</subfield><subfield code="z">(OCoLC)1086506927</subfield><subfield code="z">(OCoLC)1162014656</subfield><subfield code="z">(OCoLC)1241943713</subfield><subfield code="z">(OCoLC)1300664776</subfield></datafield><datafield tag="050" ind1=" " ind2="4"><subfield code="a">TK3226</subfield><subfield code="b">.C467 2003eb</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">MAT</subfield><subfield code="x">016000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">MAT</subfield><subfield code="x">018000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="082" ind1="7" ind2=" "><subfield code="a">511.3</subfield><subfield code="2">22</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">MAIN</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Chen, Wai-Kai,</subfield><subfield code="d">1936-</subfield><subfield code="1">https://id.oclc.org/worldcat/entity/E39PBJyCCHRrC93Wrwjfkyvj4q</subfield><subfield code="0">http://id.loc.gov/authorities/names/n50059490</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Net theory and its applications :</subfield><subfield code="b">flows in networks /</subfield><subfield code="c">Wai-Kai Chen.</subfield></datafield><datafield tag="260" ind1=" " ind2=" "><subfield code="a">London :</subfield><subfield code="b">Imperial College Press,</subfield><subfield code="c">2003.</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (x, 660 pages) :</subfield><subfield code="b">illustrations</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">computer</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">online resource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Series in electrical and computer engineering ;</subfield><subfield code="v">vol. 1</subfield></datafield><datafield tag="504" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references and index.</subfield></datafield><datafield tag="588" ind1="0" ind2=" "><subfield code="a">Print version record.</subfield></datafield><datafield tag="505" ind1="0" ind2=" "><subfield code="a">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.8. Directed graphs. 1.9. The circuit matrix associated with a planar graph or directed graph. 1.10. Summary and suggested reading -- 2. The shortest directed path problem. 2.1. Shortest directed paths. 2.2. Shortest directed path algorithms. 2.3. Multiterminal shortest directed paths. 2.4. Enumeration of the shortest directed paths by decomposition. 2.5. Summary and suggested reading -- 3. Maximum flows in networks. 3.1. Flows. 3.2. s-t cuts. 3.3. Maximum flow. 3.4. Ford-Fulkerson algorithm. 3.5. Layered nets. 3.6. A blocking flow algorithm. 3.7. Variants of the Ford-Fulkerson algorithm. 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 -- 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.4. Terminal capacity matrix. 4.5. Synthesis of a flow-equivalent tree. 4.6. Synthesis of optimum undirected communication nets. 4.7. Oriented communication nets. 4.8. Summary and suggested reading -- 5. Feasibility theorems and their applications. 5.1. A supply-demand theorem. 5.2. An extended supply-demand theorem. 5.3. Circulation theorem. 5.4. Feasible circulation algorithm. 5.5. Flows in nets with lower bounds on arcs. 5.6. Feasible flows in node-and-arc capacitated nets. 5.7. Summary and suggested reading -- 6. Applications of flow theorems to subgraph problems. 6.1. The subgraph problem of a directed graph. 6.2. Digraphic sequences. 6.3. The subgraph problem of a graph. 6.4. Graphical sequences. 6.5. The (p, s)-matrix. 6.6. Realization of the 1-matrix and the (1, 0)-matrix. 6.7. Minimal transformations. 6.8. Summary and suggested reading -- 7. Signal-flow graphs. 7.1. The signal-flow graph. 7.2. Topological evaluation of determinants. 7.3. Topological evaluation of cofactors. 7.4. Topological solutions of linear algebraic equations. 7.5. Equivalence and transformation. 7.6. The matrix inversion. 7.7. Signal-flow graph formulation of feedback amplifier theory. 7.8. Matrix signal-flow graph. 7.9. The multiple-loop feedback amplifier theory. 7.10. Summary and suggested reading -- 8. Other net applications. 8.1. Boolean matrices and switching nets. 8.2. Tellegen's theorem. 8.3. Generalized signal-flow graphs. 8.4. Permutations by spaghetti Amida. 8.5. The Amida graph. 8.6. Graph decomposition and hybrid analysis of electrical networks. 8.7. Summary and suggested reading.</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">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.</subfield></datafield><datafield tag="546" ind1=" " ind2=" "><subfield code="a">English.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Machine theory.</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh85079341</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Nets (Mathematics)</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh85091044</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Flowgraphs.</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh85049350</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">System analysis.</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh85131733</subfield></datafield><datafield tag="650" ind1=" " ind2="2"><subfield code="a">Systems Analysis</subfield><subfield code="0">https://id.nlm.nih.gov/mesh/D013597</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Réseaux (Mathématiques)</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Graphes de fluence.</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Analyse de systèmes.</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Théorie des automates.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">systems analysis.</subfield><subfield code="2">aat</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">MATHEMATICS</subfield><subfield code="x">Infinity.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">MATHEMATICS</subfield><subfield code="x">Logic.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">System analysis</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Nets (Mathematics)</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Flowgraphs</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Machine theory</subfield><subfield code="2">fast</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Print version:</subfield><subfield code="a">Chen, Wai-Kai, 1936-</subfield><subfield code="t">Net theory and its applications.</subfield><subfield code="d">London : Imperial College Press, 2003</subfield><subfield code="z">1860942261</subfield><subfield code="z">9781860942266</subfield><subfield code="w">(DLC) 2005281859</subfield><subfield code="w">(OCoLC)52785429</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Series in electrical and computer engineering ;</subfield><subfield code="v">vol. 1.</subfield><subfield code="0">http://id.loc.gov/authorities/names/no2003123710</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="l">FWS01</subfield><subfield code="p">ZDB-4-EBA</subfield><subfield code="q">FWS_PDA_EBA</subfield><subfield code="u">https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=235547</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">Askews and Holts Library Services</subfield><subfield code="b">ASKH</subfield><subfield code="n">AH24682547</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">ebrary</subfield><subfield code="b">EBRY</subfield><subfield code="n">ebr10255584</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">EBSCOhost</subfield><subfield code="b">EBSC</subfield><subfield code="n">235547</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">2889004</subfield></datafield><datafield tag="994" ind1=" " ind2=" "><subfield code="a">92</subfield><subfield code="b">GEBAY</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-4-EBA</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-863</subfield></datafield></record></collection> |
| id | ZDB-4-EBA-ocn261127898 |
| illustrated | Illustrated |
| indexdate | 2024-11-27T13:16:32Z |
| institution | BVB |
| isbn | 9781848161290 1848161298 1281865907 9781281865908 9786611865900 661186590X |
| language | English |
| oclc_num | 261127898 |
| open_access_boolean | |
| owner | MAIN DE-863 DE-BY-FWS |
| owner_facet | MAIN DE-863 DE-BY-FWS |
| physical | 1 online resource (x, 660 pages) : illustrations |
| psigel | ZDB-4-EBA |
| publishDate | 2003 |
| publishDateSearch | 2003 |
| publishDateSort | 2003 |
| publisher | Imperial College Press, |
| record_format | marc |
| series | Series in electrical and computer engineering ; |
| series2 | Series in electrical and computer engineering ; |
| spelling | Chen, Wai-Kai, 1936- https://id.oclc.org/worldcat/entity/E39PBJyCCHRrC93Wrwjfkyvj4q http://id.loc.gov/authorities/names/n50059490 Net theory and its applications : flows in networks / Wai-Kai Chen. London : Imperial College Press, 2003. 1 online resource (x, 660 pages) : illustrations text txt rdacontent computer c rdamedia online resource cr rdacarrier Series in electrical and computer engineering ; vol. 1 Includes bibliographical references and index. Print version record. 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.8. Directed graphs. 1.9. The circuit matrix associated with a planar graph or directed graph. 1.10. Summary and suggested reading -- 2. The shortest directed path problem. 2.1. Shortest directed paths. 2.2. Shortest directed path algorithms. 2.3. Multiterminal shortest directed paths. 2.4. Enumeration of the shortest directed paths by decomposition. 2.5. Summary and suggested reading -- 3. Maximum flows in networks. 3.1. Flows. 3.2. s-t cuts. 3.3. Maximum flow. 3.4. Ford-Fulkerson algorithm. 3.5. Layered nets. 3.6. A blocking flow algorithm. 3.7. Variants of the Ford-Fulkerson algorithm. 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 -- 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.4. Terminal capacity matrix. 4.5. Synthesis of a flow-equivalent tree. 4.6. Synthesis of optimum undirected communication nets. 4.7. Oriented communication nets. 4.8. Summary and suggested reading -- 5. Feasibility theorems and their applications. 5.1. A supply-demand theorem. 5.2. An extended supply-demand theorem. 5.3. Circulation theorem. 5.4. Feasible circulation algorithm. 5.5. Flows in nets with lower bounds on arcs. 5.6. Feasible flows in node-and-arc capacitated nets. 5.7. Summary and suggested reading -- 6. Applications of flow theorems to subgraph problems. 6.1. The subgraph problem of a directed graph. 6.2. Digraphic sequences. 6.3. The subgraph problem of a graph. 6.4. Graphical sequences. 6.5. The (p, s)-matrix. 6.6. Realization of the 1-matrix and the (1, 0)-matrix. 6.7. Minimal transformations. 6.8. Summary and suggested reading -- 7. Signal-flow graphs. 7.1. The signal-flow graph. 7.2. Topological evaluation of determinants. 7.3. Topological evaluation of cofactors. 7.4. Topological solutions of linear algebraic equations. 7.5. Equivalence and transformation. 7.6. The matrix inversion. 7.7. Signal-flow graph formulation of feedback amplifier theory. 7.8. Matrix signal-flow graph. 7.9. The multiple-loop feedback amplifier theory. 7.10. Summary and suggested reading -- 8. Other net applications. 8.1. Boolean matrices and switching nets. 8.2. Tellegen's theorem. 8.3. Generalized signal-flow graphs. 8.4. Permutations by spaghetti Amida. 8.5. The Amida graph. 8.6. Graph decomposition and hybrid analysis of electrical networks. 8.7. Summary and suggested reading. 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. English. Machine theory. http://id.loc.gov/authorities/subjects/sh85079341 Nets (Mathematics) http://id.loc.gov/authorities/subjects/sh85091044 Flowgraphs. http://id.loc.gov/authorities/subjects/sh85049350 System analysis. http://id.loc.gov/authorities/subjects/sh85131733 Systems Analysis https://id.nlm.nih.gov/mesh/D013597 Réseaux (Mathématiques) Graphes de fluence. Analyse de systèmes. Théorie des automates. systems analysis. aat MATHEMATICS Infinity. bisacsh MATHEMATICS Logic. bisacsh System analysis fast Nets (Mathematics) fast Flowgraphs fast Machine theory fast Print version: Chen, Wai-Kai, 1936- Net theory and its applications. London : Imperial College Press, 2003 1860942261 9781860942266 (DLC) 2005281859 (OCoLC)52785429 Series in electrical and computer engineering ; vol. 1. http://id.loc.gov/authorities/names/no2003123710 FWS01 ZDB-4-EBA FWS_PDA_EBA https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=235547 Volltext |
| spellingShingle | Chen, Wai-Kai, 1936- Net theory and its applications : flows in networks / Series in electrical and computer engineering ; 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.8. Directed graphs. 1.9. The circuit matrix associated with a planar graph or directed graph. 1.10. Summary and suggested reading -- 2. The shortest directed path problem. 2.1. Shortest directed paths. 2.2. Shortest directed path algorithms. 2.3. Multiterminal shortest directed paths. 2.4. Enumeration of the shortest directed paths by decomposition. 2.5. Summary and suggested reading -- 3. Maximum flows in networks. 3.1. Flows. 3.2. s-t cuts. 3.3. Maximum flow. 3.4. Ford-Fulkerson algorithm. 3.5. Layered nets. 3.6. A blocking flow algorithm. 3.7. Variants of the Ford-Fulkerson algorithm. 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 -- 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.4. Terminal capacity matrix. 4.5. Synthesis of a flow-equivalent tree. 4.6. Synthesis of optimum undirected communication nets. 4.7. Oriented communication nets. 4.8. Summary and suggested reading -- 5. Feasibility theorems and their applications. 5.1. A supply-demand theorem. 5.2. An extended supply-demand theorem. 5.3. Circulation theorem. 5.4. Feasible circulation algorithm. 5.5. Flows in nets with lower bounds on arcs. 5.6. Feasible flows in node-and-arc capacitated nets. 5.7. Summary and suggested reading -- 6. Applications of flow theorems to subgraph problems. 6.1. The subgraph problem of a directed graph. 6.2. Digraphic sequences. 6.3. The subgraph problem of a graph. 6.4. Graphical sequences. 6.5. The (p, s)-matrix. 6.6. Realization of the 1-matrix and the (1, 0)-matrix. 6.7. Minimal transformations. 6.8. Summary and suggested reading -- 7. Signal-flow graphs. 7.1. The signal-flow graph. 7.2. Topological evaluation of determinants. 7.3. Topological evaluation of cofactors. 7.4. Topological solutions of linear algebraic equations. 7.5. Equivalence and transformation. 7.6. The matrix inversion. 7.7. Signal-flow graph formulation of feedback amplifier theory. 7.8. Matrix signal-flow graph. 7.9. The multiple-loop feedback amplifier theory. 7.10. Summary and suggested reading -- 8. Other net applications. 8.1. Boolean matrices and switching nets. 8.2. Tellegen's theorem. 8.3. Generalized signal-flow graphs. 8.4. Permutations by spaghetti Amida. 8.5. The Amida graph. 8.6. Graph decomposition and hybrid analysis of electrical networks. 8.7. Summary and suggested reading. Machine theory. http://id.loc.gov/authorities/subjects/sh85079341 Nets (Mathematics) http://id.loc.gov/authorities/subjects/sh85091044 Flowgraphs. http://id.loc.gov/authorities/subjects/sh85049350 System analysis. http://id.loc.gov/authorities/subjects/sh85131733 Systems Analysis https://id.nlm.nih.gov/mesh/D013597 Réseaux (Mathématiques) Graphes de fluence. Analyse de systèmes. Théorie des automates. systems analysis. aat MATHEMATICS Infinity. bisacsh MATHEMATICS Logic. bisacsh System analysis fast Nets (Mathematics) fast Flowgraphs fast Machine theory fast |
| subject_GND | http://id.loc.gov/authorities/subjects/sh85079341 http://id.loc.gov/authorities/subjects/sh85091044 http://id.loc.gov/authorities/subjects/sh85049350 http://id.loc.gov/authorities/subjects/sh85131733 https://id.nlm.nih.gov/mesh/D013597 |
| title | Net theory and its applications : flows in networks / |
| title_auth | Net theory and its applications : flows in networks / |
| title_exact_search | Net theory and its applications : flows in networks / |
| title_full | Net theory and its applications : flows in networks / Wai-Kai Chen. |
| title_fullStr | Net theory and its applications : flows in networks / Wai-Kai Chen. |
| title_full_unstemmed | Net theory and its applications : flows in networks / Wai-Kai Chen. |
| title_short | Net theory and its applications : |
| title_sort | net theory and its applications flows in networks |
| title_sub | flows in networks / |
| topic | Machine theory. http://id.loc.gov/authorities/subjects/sh85079341 Nets (Mathematics) http://id.loc.gov/authorities/subjects/sh85091044 Flowgraphs. http://id.loc.gov/authorities/subjects/sh85049350 System analysis. http://id.loc.gov/authorities/subjects/sh85131733 Systems Analysis https://id.nlm.nih.gov/mesh/D013597 Réseaux (Mathématiques) Graphes de fluence. Analyse de systèmes. Théorie des automates. systems analysis. aat MATHEMATICS Infinity. bisacsh MATHEMATICS Logic. bisacsh System analysis fast Nets (Mathematics) fast Flowgraphs fast Machine theory fast |
| topic_facet | Machine theory. Nets (Mathematics) Flowgraphs. System analysis. Systems Analysis Réseaux (Mathématiques) Graphes de fluence. Analyse de systèmes. Théorie des automates. systems analysis. MATHEMATICS Infinity. MATHEMATICS Logic. System analysis Flowgraphs Machine theory |
| url | https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=235547 |
| work_keys_str_mv | AT chenwaikai nettheoryanditsapplicationsflowsinnetworks |