Combinatorial Network Theory:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Boston, MA
Springer US
1996
|
| Schriftenreihe: | Applied Optimization
1 |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Beschreibung: | A basic problem for the interconnection of communications media is to design interconnection networks for specific needs. For example, to minimize delay and to maximize reliability, networks are required that have minimum diameter and maximum connectivity under certain conditions. The book provides a recent solution to this problem. The subject of all five chapters is the interconnection problem. The first two chapters deal with Cayley digraphs which are candidates for networks of maximum connectivity with given degree and number of nodes. Chapter 3 addresses Bruijn digraphs, Kautz digraphs, and their generalizations, which are candidates for networks of minimum diameter and maximum connectivity with given degree and number of nodes. Chapter 4 studies double loop networks, and Chapter 5 considers broadcasting and the Gossiping problem. All the chapters emphasize the combinatorial aspects of network theory. Audience: A vital reference for graduate students and researchers in applied mathematics and theoretical computer science |
| Beschreibung: | 1 Online-Ressource (VIII, 214 p) |
| ISBN: | 9781475724912 9781441947529 |
| ISSN: | 1384-6485 |
| DOI: | 10.1007/978-1-4757-2491-2 |
Internformat
MARC
| LEADER | 00000nmm a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV042421349 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 150317s1996 |||| o||u| ||||||eng d | ||
| 020 | |a 9781475724912 |c Online |9 978-1-4757-2491-2 | ||
| 020 | |a 9781441947529 |c Print |9 978-1-4419-4752-9 | ||
| 024 | 7 | |a 10.1007/978-1-4757-2491-2 |2 doi | |
| 035 | |a (OCoLC)863944132 | ||
| 035 | |a (DE-599)BVBBV042421349 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-384 |a DE-703 |a DE-91 |a DE-634 | ||
| 082 | 0 | |a 511.6 |2 23 | |
| 084 | |a MAT 000 |2 stub | ||
| 100 | 1 | |a Du, Ding-Zhu |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Combinatorial Network Theory |c edited by Ding-Zhu Du, D. Frank Hsu |
| 264 | 1 | |a Boston, MA |b Springer US |c 1996 | |
| 300 | |a 1 Online-Ressource (VIII, 214 p) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a Applied Optimization |v 1 |x 1384-6485 | |
| 500 | |a A basic problem for the interconnection of communications media is to design interconnection networks for specific needs. For example, to minimize delay and to maximize reliability, networks are required that have minimum diameter and maximum connectivity under certain conditions. The book provides a recent solution to this problem. The subject of all five chapters is the interconnection problem. The first two chapters deal with Cayley digraphs which are candidates for networks of maximum connectivity with given degree and number of nodes. Chapter 3 addresses Bruijn digraphs, Kautz digraphs, and their generalizations, which are candidates for networks of minimum diameter and maximum connectivity with given degree and number of nodes. Chapter 4 studies double loop networks, and Chapter 5 considers broadcasting and the Gossiping problem. All the chapters emphasize the combinatorial aspects of network theory. Audience: A vital reference for graduate students and researchers in applied mathematics and theoretical computer science | ||
| 650 | 4 | |a Mathematics | |
| 650 | 4 | |a Computational complexity | |
| 650 | 4 | |a Algebra | |
| 650 | 4 | |a Combinatorics | |
| 650 | 4 | |a Information and Communication, Circuits | |
| 650 | 4 | |a Discrete Mathematics in Computer Science | |
| 650 | 4 | |a Category Theory, Homological Algebra | |
| 650 | 4 | |a Mathematik | |
| 650 | 0 | 7 | |a Kombinatorische Analysis |0 (DE-588)4164746-4 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Netzwerkanalyse |0 (DE-588)4075298-7 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Netzwerkanalyse |0 (DE-588)4075298-7 |D s |
| 689 | 0 | 1 | |a Kombinatorische Analysis |0 (DE-588)4164746-4 |D s |
| 689 | 0 | |8 1\p |5 DE-604 | |
| 700 | 1 | |a Hsu, D. Frank |e Sonstige |4 oth | |
| 856 | 4 | 0 | |u https://doi.org/10.1007/978-1-4757-2491-2 |x Verlag |3 Volltext |
| 912 | |a ZDB-2-SMA |a ZDB-2-BAE | ||
| 940 | 1 | |q ZDB-2-SMA_Archive | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-027856766 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
Datensatz im Suchindex
| _version_ | 1804153094278217728 |
|---|---|
| any_adam_object | |
| author | Du, Ding-Zhu |
| author_facet | Du, Ding-Zhu |
| author_role | aut |
| author_sort | Du, Ding-Zhu |
| author_variant | d z d dzd |
| building | Verbundindex |
| bvnumber | BV042421349 |
| classification_tum | MAT 000 |
| collection | ZDB-2-SMA ZDB-2-BAE |
| ctrlnum | (OCoLC)863944132 (DE-599)BVBBV042421349 |
| dewey-full | 511.6 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511.6 |
| dewey-search | 511.6 |
| dewey-sort | 3511.6 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| doi_str_mv | 10.1007/978-1-4757-2491-2 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02921nmm a2200541zcb4500</leader><controlfield tag="001">BV042421349</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">150317s1996 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781475724912</subfield><subfield code="c">Online</subfield><subfield code="9">978-1-4757-2491-2</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781441947529</subfield><subfield code="c">Print</subfield><subfield code="9">978-1-4419-4752-9</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-1-4757-2491-2</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)863944132</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV042421349</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-384</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-91</subfield><subfield code="a">DE-634</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.6</subfield><subfield code="2">23</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 000</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Du, Ding-Zhu</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Combinatorial Network Theory</subfield><subfield code="c">edited by Ding-Zhu Du, D. Frank Hsu</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Boston, MA</subfield><subfield code="b">Springer US</subfield><subfield code="c">1996</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (VIII, 214 p)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">Applied Optimization</subfield><subfield code="v">1</subfield><subfield code="x">1384-6485</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">A basic problem for the interconnection of communications media is to design interconnection networks for specific needs. For example, to minimize delay and to maximize reliability, networks are required that have minimum diameter and maximum connectivity under certain conditions. The book provides a recent solution to this problem. The subject of all five chapters is the interconnection problem. The first two chapters deal with Cayley digraphs which are candidates for networks of maximum connectivity with given degree and number of nodes. Chapter 3 addresses Bruijn digraphs, Kautz digraphs, and their generalizations, which are candidates for networks of minimum diameter and maximum connectivity with given degree and number of nodes. Chapter 4 studies double loop networks, and Chapter 5 considers broadcasting and the Gossiping problem. All the chapters emphasize the combinatorial aspects of network theory. Audience: A vital reference for graduate students and researchers in applied mathematics and theoretical computer science</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational complexity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algebra</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Combinatorics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Information and Communication, Circuits</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Discrete Mathematics in Computer Science</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Category Theory, Homological Algebra</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematik</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Kombinatorische Analysis</subfield><subfield code="0">(DE-588)4164746-4</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Netzwerkanalyse</subfield><subfield code="0">(DE-588)4075298-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Netzwerkanalyse</subfield><subfield code="0">(DE-588)4075298-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Kombinatorische Analysis</subfield><subfield code="0">(DE-588)4164746-4</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Hsu, D. Frank</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-1-4757-2491-2</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-SMA</subfield><subfield code="a">ZDB-2-BAE</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">ZDB-2-SMA_Archive</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-027856766</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield></record></collection> |
| id | DE-604.BV042421349 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T01:21:08Z |
| institution | BVB |
| isbn | 9781475724912 9781441947529 |
| issn | 1384-6485 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-027856766 |
| oclc_num | 863944132 |
| open_access_boolean | |
| owner | DE-384 DE-703 DE-91 DE-BY-TUM DE-634 |
| owner_facet | DE-384 DE-703 DE-91 DE-BY-TUM DE-634 |
| physical | 1 Online-Ressource (VIII, 214 p) |
| psigel | ZDB-2-SMA ZDB-2-BAE ZDB-2-SMA_Archive |
| publishDate | 1996 |
| publishDateSearch | 1996 |
| publishDateSort | 1996 |
| publisher | Springer US |
| record_format | marc |
| series2 | Applied Optimization |
| spelling | Du, Ding-Zhu Verfasser aut Combinatorial Network Theory edited by Ding-Zhu Du, D. Frank Hsu Boston, MA Springer US 1996 1 Online-Ressource (VIII, 214 p) txt rdacontent c rdamedia cr rdacarrier Applied Optimization 1 1384-6485 A basic problem for the interconnection of communications media is to design interconnection networks for specific needs. For example, to minimize delay and to maximize reliability, networks are required that have minimum diameter and maximum connectivity under certain conditions. The book provides a recent solution to this problem. The subject of all five chapters is the interconnection problem. The first two chapters deal with Cayley digraphs which are candidates for networks of maximum connectivity with given degree and number of nodes. Chapter 3 addresses Bruijn digraphs, Kautz digraphs, and their generalizations, which are candidates for networks of minimum diameter and maximum connectivity with given degree and number of nodes. Chapter 4 studies double loop networks, and Chapter 5 considers broadcasting and the Gossiping problem. All the chapters emphasize the combinatorial aspects of network theory. Audience: A vital reference for graduate students and researchers in applied mathematics and theoretical computer science Mathematics Computational complexity Algebra Combinatorics Information and Communication, Circuits Discrete Mathematics in Computer Science Category Theory, Homological Algebra Mathematik Kombinatorische Analysis (DE-588)4164746-4 gnd rswk-swf Netzwerkanalyse (DE-588)4075298-7 gnd rswk-swf Netzwerkanalyse (DE-588)4075298-7 s Kombinatorische Analysis (DE-588)4164746-4 s 1\p DE-604 Hsu, D. Frank Sonstige oth https://doi.org/10.1007/978-1-4757-2491-2 Verlag Volltext 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Du, Ding-Zhu Combinatorial Network Theory Mathematics Computational complexity Algebra Combinatorics Information and Communication, Circuits Discrete Mathematics in Computer Science Category Theory, Homological Algebra Mathematik Kombinatorische Analysis (DE-588)4164746-4 gnd Netzwerkanalyse (DE-588)4075298-7 gnd |
| subject_GND | (DE-588)4164746-4 (DE-588)4075298-7 |
| title | Combinatorial Network Theory |
| title_auth | Combinatorial Network Theory |
| title_exact_search | Combinatorial Network Theory |
| title_full | Combinatorial Network Theory edited by Ding-Zhu Du, D. Frank Hsu |
| title_fullStr | Combinatorial Network Theory edited by Ding-Zhu Du, D. Frank Hsu |
| title_full_unstemmed | Combinatorial Network Theory edited by Ding-Zhu Du, D. Frank Hsu |
| title_short | Combinatorial Network Theory |
| title_sort | combinatorial network theory |
| topic | Mathematics Computational complexity Algebra Combinatorics Information and Communication, Circuits Discrete Mathematics in Computer Science Category Theory, Homological Algebra Mathematik Kombinatorische Analysis (DE-588)4164746-4 gnd Netzwerkanalyse (DE-588)4075298-7 gnd |
| topic_facet | Mathematics Computational complexity Algebra Combinatorics Information and Communication, Circuits Discrete Mathematics in Computer Science Category Theory, Homological Algebra Mathematik Kombinatorische Analysis Netzwerkanalyse |
| url | https://doi.org/10.1007/978-1-4757-2491-2 |
| work_keys_str_mv | AT dudingzhu combinatorialnetworktheory AT hsudfrank combinatorialnetworktheory |