Combinatorial network theory:
A basic problem for the interconnection of communicating media is to design interconnection networks for specific needs. For example, to minimize delay and to maximize reability, networks are required that have minimum diameter and maximum connectivity under certain conditions. The book provides a r...
Gespeichert in:
| Format: | Buch |
|---|---|
| Sprache: | English |
| Veröffentlicht: |
Dordrecht [u.a.]
Kluwer
1996
|
| Schriftenreihe: | Applied optimization
1 |
| Schlagworte: | |
| Zusammenfassung: | A basic problem for the interconnection of communicating media is to design interconnection networks for specific needs. For example, to minimize delay and to maximize reability, 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 de 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 |
| Beschreibung: | VII, 212 S. graph. Darst. |
| ISBN: | 0792337778 |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010841726 | ||
| 003 | DE-604 | ||
| 005 | 19961218 | ||
| 007 | t | ||
| 008 | 960710s1996 ne d||| |||| 00||| eng d | ||
| 020 | |a 0792337778 |9 0-7923-3777-8 | ||
| 035 | |a (OCoLC)33162463 | ||
| 035 | |a (DE-599)BVBBV010841726 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 044 | |a ne |c XA-NL | ||
| 049 | |a DE-29T |a DE-739 |a DE-703 |a DE-91 |a DE-91G |a DE-521 |a DE-188 | ||
| 050 | 0 | |a T57.85.C65 1996 | |
| 082 | 0 | |a 511/.5 20 | |
| 082 | 0 | |a 511/.5 |2 20 | |
| 084 | |a SK 890 |0 (DE-625)143267: |2 rvk | ||
| 084 | |a ST 200 |0 (DE-625)143611: |2 rvk | ||
| 084 | |a DAT 195f |2 stub | ||
| 245 | 1 | 0 | |a Combinatorial network theory |c ed. by Ding-Zhu Du ... |
| 264 | 1 | |a Dordrecht [u.a.] |b Kluwer |c 1996 | |
| 300 | |a VII, 212 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Applied optimization |v 1 | |
| 520 | 3 | |a A basic problem for the interconnection of communicating media is to design interconnection networks for specific needs. For example, to minimize delay and to maximize reability, 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 | |
| 520 | |a 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 de 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 | ||
| 520 | |a All the chapters emphasize the combinatorial aspects of network theory | ||
| 650 | 7 | |a Analyse combinatoire |2 ram | |
| 650 | 7 | |a Analyse de réseau (planification) |2 ram | |
| 650 | 7 | |a Combinatieleer |2 gtt | |
| 650 | 7 | |a Graphes, Théorie des |2 ram | |
| 650 | 7 | |a Netwerkanalyse |2 gtt | |
| 650 | 7 | |a Réseaux (mathématiques) |2 ram | |
| 650 | 4 | |a Network analysis (Planning) | |
| 650 | 4 | |a Combinatorial analysis | |
| 650 | 0 | 7 | |a Netzwerkanalyse |0 (DE-588)4075298-7 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Kombinatorische Analysis |0 (DE-588)4164746-4 |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 | |5 DE-604 | |
| 700 | 1 | |a Du, Dingzhu |d 1948- |e Sonstige |0 (DE-588)1013682580 |4 oth | |
| 830 | 0 | |a Applied optimization |v 1 |w (DE-604)BV010841718 |9 1 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007247236 | ||
Datensatz im Suchindex
| _version_ | 1804125329418092544 |
|---|---|
| any_adam_object | |
| author_GND | (DE-588)1013682580 |
| building | Verbundindex |
| bvnumber | BV010841726 |
| callnumber-first | T - Technology |
| callnumber-label | T57 |
| callnumber-raw | T57.85.C65 1996 |
| callnumber-search | T57.85.C65 1996 |
| callnumber-sort | T 257.85 C65 41996 |
| callnumber-subject | T - General Technology |
| classification_rvk | SK 890 ST 200 |
| classification_tum | DAT 195f |
| ctrlnum | (OCoLC)33162463 (DE-599)BVBBV010841726 |
| dewey-full | 511/.520 511/.5 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511/.5 20 511/.5 |
| dewey-search | 511/.5 20 511/.5 |
| dewey-sort | 3511 15 220 |
| dewey-tens | 510 - Mathematics |
| discipline | Informatik Mathematik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02702nam a2200553 cb4500</leader><controlfield tag="001">BV010841726</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19961218 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">960710s1996 ne d||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0792337778</subfield><subfield code="9">0-7923-3777-8</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)33162463</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010841726</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">ne</subfield><subfield code="c">XA-NL</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-29T</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-91</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-521</subfield><subfield code="a">DE-188</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">T57.85.C65 1996</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511/.5 20</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511/.5</subfield><subfield code="2">20</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 890</subfield><subfield code="0">(DE-625)143267:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 200</subfield><subfield code="0">(DE-625)143611:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 195f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Combinatorial network theory</subfield><subfield code="c">ed. by Ding-Zhu Du ...</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Dordrecht [u.a.]</subfield><subfield code="b">Kluwer</subfield><subfield code="c">1996</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">VII, 212 S.</subfield><subfield code="b">graph. Darst.</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">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Applied optimization</subfield><subfield code="v">1</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">A basic problem for the interconnection of communicating media is to design interconnection networks for specific needs. For example, to minimize delay and to maximize reability, 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</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">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 de 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</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">All the chapters emphasize the combinatorial aspects of network theory</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Analyse combinatoire</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Analyse de réseau (planification)</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Combinatieleer</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Graphes, Théorie des</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Netwerkanalyse</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Réseaux (mathématiques)</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Network analysis (Planning)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Combinatorial analysis</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="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="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="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Du, Dingzhu</subfield><subfield code="d">1948-</subfield><subfield code="e">Sonstige</subfield><subfield code="0">(DE-588)1013682580</subfield><subfield code="4">oth</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Applied optimization</subfield><subfield code="v">1</subfield><subfield code="w">(DE-604)BV010841718</subfield><subfield code="9">1</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007247236</subfield></datafield></record></collection> |
| id | DE-604.BV010841726 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T17:59:50Z |
| institution | BVB |
| isbn | 0792337778 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007247236 |
| oclc_num | 33162463 |
| open_access_boolean | |
| owner | DE-29T DE-739 DE-703 DE-91 DE-BY-TUM DE-91G DE-BY-TUM DE-521 DE-188 |
| owner_facet | DE-29T DE-739 DE-703 DE-91 DE-BY-TUM DE-91G DE-BY-TUM DE-521 DE-188 |
| physical | VII, 212 S. graph. Darst. |
| publishDate | 1996 |
| publishDateSearch | 1996 |
| publishDateSort | 1996 |
| publisher | Kluwer |
| record_format | marc |
| series | Applied optimization |
| series2 | Applied optimization |
| spelling | Combinatorial network theory ed. by Ding-Zhu Du ... Dordrecht [u.a.] Kluwer 1996 VII, 212 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Applied optimization 1 A basic problem for the interconnection of communicating media is to design interconnection networks for specific needs. For example, to minimize delay and to maximize reability, 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 de 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 Analyse combinatoire ram Analyse de réseau (planification) ram Combinatieleer gtt Graphes, Théorie des ram Netwerkanalyse gtt Réseaux (mathématiques) ram Network analysis (Planning) Combinatorial analysis Netzwerkanalyse (DE-588)4075298-7 gnd rswk-swf Kombinatorische Analysis (DE-588)4164746-4 gnd rswk-swf Netzwerkanalyse (DE-588)4075298-7 s Kombinatorische Analysis (DE-588)4164746-4 s DE-604 Du, Dingzhu 1948- Sonstige (DE-588)1013682580 oth Applied optimization 1 (DE-604)BV010841718 1 |
| spellingShingle | Combinatorial network theory Applied optimization Analyse combinatoire ram Analyse de réseau (planification) ram Combinatieleer gtt Graphes, Théorie des ram Netwerkanalyse gtt Réseaux (mathématiques) ram Network analysis (Planning) Combinatorial analysis Netzwerkanalyse (DE-588)4075298-7 gnd Kombinatorische Analysis (DE-588)4164746-4 gnd |
| subject_GND | (DE-588)4075298-7 (DE-588)4164746-4 |
| title | Combinatorial network theory |
| title_auth | Combinatorial network theory |
| title_exact_search | Combinatorial network theory |
| title_full | Combinatorial network theory ed. by Ding-Zhu Du ... |
| title_fullStr | Combinatorial network theory ed. by Ding-Zhu Du ... |
| title_full_unstemmed | Combinatorial network theory ed. by Ding-Zhu Du ... |
| title_short | Combinatorial network theory |
| title_sort | combinatorial network theory |
| topic | Analyse combinatoire ram Analyse de réseau (planification) ram Combinatieleer gtt Graphes, Théorie des ram Netwerkanalyse gtt Réseaux (mathématiques) ram Network analysis (Planning) Combinatorial analysis Netzwerkanalyse (DE-588)4075298-7 gnd Kombinatorische Analysis (DE-588)4164746-4 gnd |
| topic_facet | Analyse combinatoire Analyse de réseau (planification) Combinatieleer Graphes, Théorie des Netwerkanalyse Réseaux (mathématiques) Network analysis (Planning) Combinatorial analysis Netzwerkanalyse Kombinatorische Analysis |
| volume_link | (DE-604)BV010841718 |
| work_keys_str_mv | AT dudingzhu combinatorialnetworktheory |