Bipartite graphs and their applications:
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Cambridge
Cambridge University Press
1998
|
| Ausgabe: | 1. publication |
| Schriftenreihe: | Cambridge Tracts in Mathematics
131 |
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | XI, 259 Seiten |
| ISBN: | 052159345X |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV012128985 | ||
| 003 | DE-604 | ||
| 005 | 20210301 | ||
| 007 | t | ||
| 008 | 980828s1998 |||| 00||| eng d | ||
| 020 | |a 052159345X |9 0-521-59345-X | ||
| 035 | |a (OCoLC)36799351 | ||
| 035 | |a (DE-599)BVBBV012128985 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-739 |a DE-634 |a DE-188 | ||
| 050 | 0 | |a QA166.14 | |
| 082 | 0 | |a 511/.5 |2 21 | |
| 084 | |a SK 890 |0 (DE-625)143267: |2 rvk | ||
| 100 | 1 | |a Asratian, Armen S. |d 1951- |e Verfasser |0 (DE-588)142321842 |4 aut | |
| 245 | 1 | 0 | |a Bipartite graphs and their applications |c Armen S. Asratian, Luleå University, Tristan M. J. Denley, University of Mississippi, Roland Häggkvist, Umeå University |
| 250 | |a 1. publication | ||
| 264 | 1 | |a Cambridge |b Cambridge University Press |c 1998 | |
| 300 | |a XI, 259 Seiten | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Cambridge Tracts in Mathematics |v 131 | |
| 650 | 7 | |a Grafentheorie |2 gtt | |
| 650 | 7 | |a Toepassingen |2 gtt | |
| 650 | 4 | |a Bipartite graphs | |
| 650 | 0 | 7 | |a Bipartiter Graph |0 (DE-588)4145661-0 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Graph |0 (DE-588)4021842-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Graphentheorie |0 (DE-588)4113782-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Graphenklasse |0 (DE-588)4158051-5 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Graphenklasse |0 (DE-588)4158051-5 |D s |
| 689 | 0 | 1 | |a Graphentheorie |0 (DE-588)4113782-6 |D s |
| 689 | 0 | 2 | |a Graph |0 (DE-588)4021842-9 |D s |
| 689 | 0 | 3 | |a Bipartiter Graph |0 (DE-588)4145661-0 |D s |
| 689 | 0 | |5 DE-604 | |
| 700 | 1 | |a Denley, Tristan M. J. |d 1967- |e Verfasser |0 (DE-588)142322075 |4 aut | |
| 700 | 1 | |a Häggkvist, Roland |d 1950- |e Verfasser |0 (DE-588)142322148 |4 aut | |
| 830 | 0 | |a Cambridge Tracts in Mathematics |v 131 |w (DE-604)BV000000001 |9 131 | |
| 856 | 4 | 2 | |m HBZ Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=008214064&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-008214064 | ||
Datensatz im Suchindex
| _version_ | 1804126736081747968 |
|---|---|
| adam_text | Contents
Preface vii
Notation xi
Chapter 1 Basic concepts 1
1.1 Graphs 1
1.2 Partially ordered sets 4
1.3 Reducibility of problems and NP completeness 4
Chapter 2 Introduction to bipartite graphs 7
2.1 Recognising bipartite graphs 7
2.2 Bipartite graphs of certain types 10
2.3 Matrix characterisations of bipartite graphs 15
Application
2.4 Gaussian elimination 20
Chapter 3 Metric properties 23
3.1 Radius and diameter 23
3.2 Metric properties of trees 28
3.3 Metric properties of the n cube 32
Application
3.4 Addressing schemes for computer networks 39
Chapter 4 Connectivity 45
4.1 /c connected graphs 45
4.2 fc edge connected graphs 48
Application
4.3 The construction of linear superconcentrators 52
Chapter 5 Maximum matchings 56
5.1 Properties of maximum matchings 56
5.2 Finding a maximum matching 59
5.3 Maximum matchings in convex bipartite graphs 65
5.4 Stable matchings 67
Application
5.5 The Generalised Assignment Problem 71
Chapter 6 Expanding properties 75
6.1 Graphs with Hall s condition 75
6.2 Expanding graphs 82
6.3 Expanders 85
Application
6.4 Expanders and sorters 90
v
vi Contents
Chapter 7 Subgraphs with restricted degrees 97
7.1 (pj) factors 97
7.2 Subgraphs with given degrees 100
7.3 2 factors and Hamilton cycles 106
7.4 T joins 114
Application
7.5 Isomer problems in chemistry 118
Chapter 8 Edge colourings 125
8.1 Edge colourings and timetables 125
8.2 Interval edge colourings 130
8.3 List colourings 138
8.4 Colour feasible sequences 144
8.5 Transformations of proper colourings 150
8.6 Uniquely colourable bipartite graphs 156
Application
8.7 Rearrangeable telephone networks 160
Chapter 9 Doubly stochastic matrices and bipartite graphs 163
9.1 Convex representations of doubly stochastic matrices 163
9.2 Matrices with a unique convex representation 166
9.3 Permanents and perfect matchings 168
Chapter 10 Coverings 174
10.1 Some examples of covering problems 174
10.2 Vertex coverings and independent sets 179
10.3 Dulmage and Mendelsohn s canonical decomposition 184
Application
10.4 Decomposition of partially ordered sets into chains 190
Chapter 11 Some combinatorial applications 192
11.1 Systems of distinct representatives 192
11.2 Generation of subsets of a set 198
11.3 Pebbling in hypergrids 201
11.4 Completing latin squares 205
Chapter 12 Bipartite subgraphs of arbitrary graphs 214
12.1 Spanning bipartite subgraphs 214
12.2 Covering the edges of a graph with bipartite subgraphs 218
Applications
12.3 Optimal spanning trees and the
Travelling Salesman Problem 226
12.4 The optimal spanning tree and optimal path problems 229
Appendix 232
References 237
Index 256
|
| any_adam_object | 1 |
| author | Asratian, Armen S. 1951- Denley, Tristan M. J. 1967- Häggkvist, Roland 1950- |
| author_GND | (DE-588)142321842 (DE-588)142322075 (DE-588)142322148 |
| author_facet | Asratian, Armen S. 1951- Denley, Tristan M. J. 1967- Häggkvist, Roland 1950- |
| author_role | aut aut aut |
| author_sort | Asratian, Armen S. 1951- |
| author_variant | a s a as asa t m j d tmj tmjd r h rh |
| building | Verbundindex |
| bvnumber | BV012128985 |
| callnumber-first | Q - Science |
| callnumber-label | QA166 |
| callnumber-raw | QA166.14 |
| callnumber-search | QA166.14 |
| callnumber-sort | QA 3166.14 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | SK 890 |
| ctrlnum | (OCoLC)36799351 (DE-599)BVBBV012128985 |
| dewey-full | 511/.5 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511/.5 |
| dewey-search | 511/.5 |
| dewey-sort | 3511 15 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| edition | 1. publication |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02108nam a2200505 cb4500</leader><controlfield tag="001">BV012128985</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20210301 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">980828s1998 |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">052159345X</subfield><subfield code="9">0-521-59345-X</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)36799351</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV012128985</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="049" ind1=" " ind2=" "><subfield code="a">DE-739</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-188</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA166.14</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511/.5</subfield><subfield code="2">21</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="100" ind1="1" ind2=" "><subfield code="a">Asratian, Armen S.</subfield><subfield code="d">1951-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)142321842</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Bipartite graphs and their applications</subfield><subfield code="c">Armen S. Asratian, Luleå University, Tristan M. J. Denley, University of Mississippi, Roland Häggkvist, Umeå University</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">1. publication</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge</subfield><subfield code="b">Cambridge University Press</subfield><subfield code="c">1998</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XI, 259 Seiten</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">Cambridge Tracts in Mathematics</subfield><subfield code="v">131</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Grafentheorie</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Toepassingen</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Bipartite graphs</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Bipartiter Graph</subfield><subfield code="0">(DE-588)4145661-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Graph</subfield><subfield code="0">(DE-588)4021842-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Graphentheorie</subfield><subfield code="0">(DE-588)4113782-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Graphenklasse</subfield><subfield code="0">(DE-588)4158051-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Graphenklasse</subfield><subfield code="0">(DE-588)4158051-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Graphentheorie</subfield><subfield code="0">(DE-588)4113782-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Graph</subfield><subfield code="0">(DE-588)4021842-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="3"><subfield code="a">Bipartiter Graph</subfield><subfield code="0">(DE-588)4145661-0</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">Denley, Tristan M. J.</subfield><subfield code="d">1967-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)142322075</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Häggkvist, Roland</subfield><subfield code="d">1950-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)142322148</subfield><subfield code="4">aut</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Cambridge Tracts in Mathematics</subfield><subfield code="v">131</subfield><subfield code="w">(DE-604)BV000000001</subfield><subfield code="9">131</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">HBZ Datenaustausch</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=008214064&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-008214064</subfield></datafield></record></collection> |
| id | DE-604.BV012128985 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T18:22:11Z |
| institution | BVB |
| isbn | 052159345X |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-008214064 |
| oclc_num | 36799351 |
| open_access_boolean | |
| owner | DE-739 DE-634 DE-188 |
| owner_facet | DE-739 DE-634 DE-188 |
| physical | XI, 259 Seiten |
| publishDate | 1998 |
| publishDateSearch | 1998 |
| publishDateSort | 1998 |
| publisher | Cambridge University Press |
| record_format | marc |
| series | Cambridge Tracts in Mathematics |
| series2 | Cambridge Tracts in Mathematics |
| spelling | Asratian, Armen S. 1951- Verfasser (DE-588)142321842 aut Bipartite graphs and their applications Armen S. Asratian, Luleå University, Tristan M. J. Denley, University of Mississippi, Roland Häggkvist, Umeå University 1. publication Cambridge Cambridge University Press 1998 XI, 259 Seiten txt rdacontent n rdamedia nc rdacarrier Cambridge Tracts in Mathematics 131 Grafentheorie gtt Toepassingen gtt Bipartite graphs Bipartiter Graph (DE-588)4145661-0 gnd rswk-swf Graph (DE-588)4021842-9 gnd rswk-swf Graphentheorie (DE-588)4113782-6 gnd rswk-swf Graphenklasse (DE-588)4158051-5 gnd rswk-swf Graphenklasse (DE-588)4158051-5 s Graphentheorie (DE-588)4113782-6 s Graph (DE-588)4021842-9 s Bipartiter Graph (DE-588)4145661-0 s DE-604 Denley, Tristan M. J. 1967- Verfasser (DE-588)142322075 aut Häggkvist, Roland 1950- Verfasser (DE-588)142322148 aut Cambridge Tracts in Mathematics 131 (DE-604)BV000000001 131 HBZ Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=008214064&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Asratian, Armen S. 1951- Denley, Tristan M. J. 1967- Häggkvist, Roland 1950- Bipartite graphs and their applications Cambridge Tracts in Mathematics Grafentheorie gtt Toepassingen gtt Bipartite graphs Bipartiter Graph (DE-588)4145661-0 gnd Graph (DE-588)4021842-9 gnd Graphentheorie (DE-588)4113782-6 gnd Graphenklasse (DE-588)4158051-5 gnd |
| subject_GND | (DE-588)4145661-0 (DE-588)4021842-9 (DE-588)4113782-6 (DE-588)4158051-5 |
| title | Bipartite graphs and their applications |
| title_auth | Bipartite graphs and their applications |
| title_exact_search | Bipartite graphs and their applications |
| title_full | Bipartite graphs and their applications Armen S. Asratian, Luleå University, Tristan M. J. Denley, University of Mississippi, Roland Häggkvist, Umeå University |
| title_fullStr | Bipartite graphs and their applications Armen S. Asratian, Luleå University, Tristan M. J. Denley, University of Mississippi, Roland Häggkvist, Umeå University |
| title_full_unstemmed | Bipartite graphs and their applications Armen S. Asratian, Luleå University, Tristan M. J. Denley, University of Mississippi, Roland Häggkvist, Umeå University |
| title_short | Bipartite graphs and their applications |
| title_sort | bipartite graphs and their applications |
| topic | Grafentheorie gtt Toepassingen gtt Bipartite graphs Bipartiter Graph (DE-588)4145661-0 gnd Graph (DE-588)4021842-9 gnd Graphentheorie (DE-588)4113782-6 gnd Graphenklasse (DE-588)4158051-5 gnd |
| topic_facet | Grafentheorie Toepassingen Bipartite graphs Bipartiter Graph Graph Graphentheorie Graphenklasse |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=008214064&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| volume_link | (DE-604)BV000000001 |
| work_keys_str_mv | AT asratianarmens bipartitegraphsandtheirapplications AT denleytristanmj bipartitegraphsandtheirapplications AT haggkvistroland bipartitegraphsandtheirapplications |