Nets, puzzles, and postmen /:
What do railways, mingling at parties, mazes, and the internet all have in common? All are networks - people or places or things that connect to one another. Peter Higgins shows that these phenomena - and many more - are underpinned by the same deep mathematical structure, and how this understanding...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Oxford ; New York :
Oxford University Press,
2007.
|
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Zusammenfassung: | What do railways, mingling at parties, mazes, and the internet all have in common? All are networks - people or places or things that connect to one another. Peter Higgins shows that these phenomena - and many more - are underpinned by the same deep mathematical structure, and how this understanding gives us remarkable new insights into the world. - ;What do road and railway systems, electrical circuits, mingling at parties, mazes, family trees, and the internet all have in common?. All are networks - either people or places or things that relate and connect to one another. Only relatively rec. |
| Beschreibung: | 1 online resource (viii, 247 pages) : illustrations |
| Bibliographie: | Includes bibliographical references (pages 236-241) and index. |
| ISBN: | 9780191551161 0191551163 9786611341558 6611341552 |
Internformat
MARC
| LEADER | 00000cam a2200000 a 4500 | ||
|---|---|---|---|
| 001 | ZDB-4-EBA-ocn227008323 | ||
| 003 | OCoLC | ||
| 005 | 20241004212047.0 | ||
| 006 | m o d | ||
| 007 | cr cnu---unuuu | ||
| 008 | 080505s2007 enka ob 001 0 eng d | ||
| 040 | |a N$T |b eng |e pn |c N$T |d OCLCQ |d N$T |d OCLCQ |d CN8ML |d E7B |d OCLCQ |d IDEBK |d OCLCQ |d OCLCF |d OCLCQ |d NLGGC |d OCLCO |d YDXCP |d OCLCQ |d OCLCO |d OCLCQ |d AZK |d LOA |d COCUF |d AGLDB |d MOR |d PIFAG |d OTZ |d OCLCQ |d U3W |d STF |d WRM |d OCLCQ |d VTS |d CEF |d NRAMU |d INT |d VT2 |d OCLCQ |d LHU |d FVL |d WYU |d UWO |d YOU |d CANPU |d OCLCQ |d CNTRU |d MT4IT |d HS0 |d SFB |d UKCRE |d OCLCQ |d OCLCO |d MHW |d OCLCO |d OCLCQ |d BRX |d YDX |d OCLCO |d OCLCL | ||
| 015 | |a GBA759534 |2 bnb | ||
| 016 | 7 | |a 013805292 |2 Uk | |
| 019 | |a 314221480 |a 455960182 |a 646742041 |a 756879252 |a 961525046 |a 962723013 |a 965996318 |a 988480193 |a 991918671 |a 994693381 |a 1037936853 |a 1038674450 |a 1044220100 |a 1044228483 |a 1045498766 |a 1055397299 |a 1056349703 |a 1056357262 |a 1059558860 |a 1059785474 |a 1060845845 |a 1066578920 |a 1074293457 |a 1081225903 |a 1099561173 |a 1125479984 |a 1136176040 |a 1153542776 |a 1228581843 |a 1286907195 | ||
| 020 | |a 9780191551161 |q (electronic bk.) | ||
| 020 | |a 0191551163 |q (electronic bk.) | ||
| 020 | |a 9786611341558 | ||
| 020 | |a 6611341552 | ||
| 020 | |z 0199218420 |q (hbk.) | ||
| 020 | |z 9780199218424 |q (hbk.) | ||
| 027 | |a MYILIB_CUp | ||
| 035 | |a (OCoLC)227008323 |z (OCoLC)314221480 |z (OCoLC)455960182 |z (OCoLC)646742041 |z (OCoLC)756879252 |z (OCoLC)961525046 |z (OCoLC)962723013 |z (OCoLC)965996318 |z (OCoLC)988480193 |z (OCoLC)991918671 |z (OCoLC)994693381 |z (OCoLC)1037936853 |z (OCoLC)1038674450 |z (OCoLC)1044220100 |z (OCoLC)1044228483 |z (OCoLC)1045498766 |z (OCoLC)1055397299 |z (OCoLC)1056349703 |z (OCoLC)1056357262 |z (OCoLC)1059558860 |z (OCoLC)1059785474 |z (OCoLC)1060845845 |z (OCoLC)1066578920 |z (OCoLC)1074293457 |z (OCoLC)1081225903 |z (OCoLC)1099561173 |z (OCoLC)1125479984 |z (OCoLC)1136176040 |z (OCoLC)1153542776 |z (OCoLC)1228581843 |z (OCoLC)1286907195 | ||
| 037 | |a 134155 |b MIL | ||
| 037 | |b CRKN/MyiLibrary |c CostDepend |f FormOnline |g AccessRestricted |n GovNo | ||
| 050 | 4 | |a QA95 |b .H54 2007eb | |
| 055 | 1 | 3 | |a QA95 |b .H54 2007eb |
| 072 | 7 | |a MAT |x 023000 |2 bisacsh | |
| 072 | 7 | |a MAT |x 026000 |2 bisacsh | |
| 072 | 7 | |a MAT |x 039000 |2 bisacsh | |
| 082 | 7 | |a 510 |2 22 | |
| 049 | |a MAIN | ||
| 100 | 1 | |a Higgins, Peter M., |d 1956- |1 https://id.oclc.org/worldcat/entity/E39PCjxmgFY7jkV3Ckcq9DfF83 |0 http://id.loc.gov/authorities/names/n85386266 | |
| 245 | 1 | 0 | |a Nets, puzzles, and postmen / |c Peter M. Higgins. |
| 260 | |a Oxford ; |a New York : |b Oxford University Press, |c 2007. | ||
| 300 | |a 1 online resource (viii, 247 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 | ||
| 504 | |a Includes bibliographical references (pages 236-241) and index. | ||
| 588 | 0 | |a Print version record. | |
| 505 | 0 | |a Nets, trees, and lies -- Trees -- Chemical isomers -- Lying liars and the lies they tell -- Trees and games of logic -- Familiar logic games -- Exotic squares and Sudoku -- The nature of nets -- The small world phenomenon -- The bridges of Ko?nigsberg -- Hand-shaking and its consequences -- Cycles that take you on a tour -- Party problems -- Colouring and planarity -- The four-colour map problem -- How edges can ruin planarity -- Rabbits out of hats: guarding the gallery ; innocent questions of points and lines ; Brouwer's fixed point theorem -- How to traverse a network -- The Euler-Fleury method -- The Chinese postman problem -- One-way systems -- Nets that remember where you have been -- Nets as machines -- Automata with something to say -- Lattices -- Spanning networks -- Sorting the traffic -- Greedy salesmen -- Finding the quick route -- The P versus NP controversy -- Going with the flow -- Network capacities and finding suitable boys -- Marriage and other problems -- Harems, maximum flows, and other things -- Novel applications of nets -- Instant insanity -- Sharing the wine -- Jealousy problems -- Mazes and labyrinths -- Trees and codes -- Reassembling RNA chains -- For connoisseurs. | |
| 520 | |a What do railways, mingling at parties, mazes, and the internet all have in common? All are networks - people or places or things that connect to one another. Peter Higgins shows that these phenomena - and many more - are underpinned by the same deep mathematical structure, and how this understanding gives us remarkable new insights into the world. - ;What do road and railway systems, electrical circuits, mingling at parties, mazes, family trees, and the internet all have in common?. All are networks - either people or places or things that relate and connect to one another. Only relatively rec. | ||
| 650 | 0 | |a Nets (Mathematics) |0 http://id.loc.gov/authorities/subjects/sh85091044 | |
| 650 | 0 | |a Mathematical recreations. |0 http://id.loc.gov/authorities/subjects/sh85082131 | |
| 650 | 0 | |a Mathematics |v Popular works. | |
| 650 | 6 | |a Réseaux (Mathématiques) | |
| 650 | 6 | |a Jeux mathématiques. | |
| 650 | 6 | |a Mathématiques |v Ouvrages de vulgarisation. | |
| 650 | 7 | |a MATHEMATICS |x Pre-Calculus. |2 bisacsh | |
| 650 | 7 | |a MATHEMATICS |x Reference. |2 bisacsh | |
| 650 | 7 | |a MATHEMATICS |x Essays. |2 bisacsh | |
| 650 | 7 | |a Mathematical recreations |2 fast | |
| 650 | 7 | |a Mathematics |2 fast | |
| 650 | 7 | |a Nets (Mathematics) |2 fast | |
| 655 | 0 | |a Electronic books. | |
| 655 | 7 | |a Popular works |2 fast | |
| 776 | 0 | 8 | |i Print version: |a Higgins, Peter M., 1956- |t Nets, puzzles, and postmen. |d Oxford ; New York : Oxford University Press, 2007 |z 0199218420 |z 9780199218424 |w (DLC) 2008295526 |w (OCoLC)163311946 |
| 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=223875 |3 Volltext |
| 938 | |a YBP Library Services |b YANK |n 20451207 | ||
| 938 | |a ebrary |b EBRY |n ebr10225222 | ||
| 938 | |a EBSCOhost |b EBSC |n 223875 | ||
| 938 | |a ProQuest MyiLibrary Digital eBook Collection |b IDEB |n 134155 | ||
| 938 | |a YBP Library Services |b YANK |n 2816885 | ||
| 938 | |a YBP Library Services |b YANK |n 2875369 | ||
| 994 | |a 92 |b GEBAY | ||
| 912 | |a ZDB-4-EBA | ||
| 049 | |a DE-863 | ||
Datensatz im Suchindex
| DE-BY-FWS_katkey | ZDB-4-EBA-ocn227008323 |
|---|---|
| _version_ | 1816881664885784576 |
| adam_text | |
| any_adam_object | |
| author | Higgins, Peter M., 1956- |
| author_GND | http://id.loc.gov/authorities/names/n85386266 |
| author_facet | Higgins, Peter M., 1956- |
| author_role | |
| author_sort | Higgins, Peter M., 1956- |
| author_variant | p m h pm pmh |
| building | Verbundindex |
| bvnumber | localFWS |
| callnumber-first | Q - Science |
| callnumber-label | QA95 |
| callnumber-raw | QA95 .H54 2007eb |
| callnumber-search | QA95 .H54 2007eb |
| callnumber-sort | QA 295 H54 42007EB |
| callnumber-subject | QA - Mathematics |
| collection | ZDB-4-EBA |
| contents | Nets, trees, and lies -- Trees -- Chemical isomers -- Lying liars and the lies they tell -- Trees and games of logic -- Familiar logic games -- Exotic squares and Sudoku -- The nature of nets -- The small world phenomenon -- The bridges of Ko?nigsberg -- Hand-shaking and its consequences -- Cycles that take you on a tour -- Party problems -- Colouring and planarity -- The four-colour map problem -- How edges can ruin planarity -- Rabbits out of hats: guarding the gallery ; innocent questions of points and lines ; Brouwer's fixed point theorem -- How to traverse a network -- The Euler-Fleury method -- The Chinese postman problem -- One-way systems -- Nets that remember where you have been -- Nets as machines -- Automata with something to say -- Lattices -- Spanning networks -- Sorting the traffic -- Greedy salesmen -- Finding the quick route -- The P versus NP controversy -- Going with the flow -- Network capacities and finding suitable boys -- Marriage and other problems -- Harems, maximum flows, and other things -- Novel applications of nets -- Instant insanity -- Sharing the wine -- Jealousy problems -- Mazes and labyrinths -- Trees and codes -- Reassembling RNA chains -- For connoisseurs. |
| ctrlnum | (OCoLC)227008323 |
| dewey-full | 510 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 510 - Mathematics |
| dewey-raw | 510 |
| dewey-search | 510 |
| dewey-sort | 3510 |
| 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>05969cam a2200757 a 4500</leader><controlfield tag="001">ZDB-4-EBA-ocn227008323</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">080505s2007 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">N$T</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">CN8ML</subfield><subfield code="d">E7B</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">IDEBK</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCF</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">NLGGC</subfield><subfield code="d">OCLCO</subfield><subfield code="d">YDXCP</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">AZK</subfield><subfield code="d">LOA</subfield><subfield code="d">COCUF</subfield><subfield code="d">AGLDB</subfield><subfield code="d">MOR</subfield><subfield code="d">PIFAG</subfield><subfield code="d">OTZ</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">U3W</subfield><subfield code="d">STF</subfield><subfield code="d">WRM</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">VTS</subfield><subfield code="d">CEF</subfield><subfield code="d">NRAMU</subfield><subfield code="d">INT</subfield><subfield code="d">VT2</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">LHU</subfield><subfield code="d">FVL</subfield><subfield code="d">WYU</subfield><subfield code="d">UWO</subfield><subfield code="d">YOU</subfield><subfield code="d">CANPU</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">CNTRU</subfield><subfield code="d">MT4IT</subfield><subfield code="d">HS0</subfield><subfield code="d">SFB</subfield><subfield code="d">UKCRE</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCO</subfield><subfield code="d">MHW</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">BRX</subfield><subfield code="d">YDX</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCL</subfield></datafield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">GBA759534</subfield><subfield code="2">bnb</subfield></datafield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">013805292</subfield><subfield code="2">Uk</subfield></datafield><datafield tag="019" ind1=" " ind2=" "><subfield code="a">314221480</subfield><subfield code="a">455960182</subfield><subfield code="a">646742041</subfield><subfield code="a">756879252</subfield><subfield code="a">961525046</subfield><subfield code="a">962723013</subfield><subfield code="a">965996318</subfield><subfield code="a">988480193</subfield><subfield code="a">991918671</subfield><subfield code="a">994693381</subfield><subfield code="a">1037936853</subfield><subfield code="a">1038674450</subfield><subfield code="a">1044220100</subfield><subfield code="a">1044228483</subfield><subfield code="a">1045498766</subfield><subfield code="a">1055397299</subfield><subfield code="a">1056349703</subfield><subfield code="a">1056357262</subfield><subfield code="a">1059558860</subfield><subfield code="a">1059785474</subfield><subfield code="a">1060845845</subfield><subfield code="a">1066578920</subfield><subfield code="a">1074293457</subfield><subfield code="a">1081225903</subfield><subfield code="a">1099561173</subfield><subfield code="a">1125479984</subfield><subfield code="a">1136176040</subfield><subfield code="a">1153542776</subfield><subfield code="a">1228581843</subfield><subfield code="a">1286907195</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780191551161</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0191551163</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9786611341558</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">6611341552</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">0199218420</subfield><subfield code="q">(hbk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">9780199218424</subfield><subfield code="q">(hbk.)</subfield></datafield><datafield tag="027" ind1=" " ind2=" "><subfield code="a">MYILIB_CUp</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)227008323</subfield><subfield code="z">(OCoLC)314221480</subfield><subfield code="z">(OCoLC)455960182</subfield><subfield code="z">(OCoLC)646742041</subfield><subfield code="z">(OCoLC)756879252</subfield><subfield code="z">(OCoLC)961525046</subfield><subfield code="z">(OCoLC)962723013</subfield><subfield code="z">(OCoLC)965996318</subfield><subfield code="z">(OCoLC)988480193</subfield><subfield code="z">(OCoLC)991918671</subfield><subfield code="z">(OCoLC)994693381</subfield><subfield code="z">(OCoLC)1037936853</subfield><subfield code="z">(OCoLC)1038674450</subfield><subfield code="z">(OCoLC)1044220100</subfield><subfield code="z">(OCoLC)1044228483</subfield><subfield code="z">(OCoLC)1045498766</subfield><subfield code="z">(OCoLC)1055397299</subfield><subfield code="z">(OCoLC)1056349703</subfield><subfield code="z">(OCoLC)1056357262</subfield><subfield code="z">(OCoLC)1059558860</subfield><subfield code="z">(OCoLC)1059785474</subfield><subfield code="z">(OCoLC)1060845845</subfield><subfield code="z">(OCoLC)1066578920</subfield><subfield code="z">(OCoLC)1074293457</subfield><subfield code="z">(OCoLC)1081225903</subfield><subfield code="z">(OCoLC)1099561173</subfield><subfield code="z">(OCoLC)1125479984</subfield><subfield code="z">(OCoLC)1136176040</subfield><subfield code="z">(OCoLC)1153542776</subfield><subfield code="z">(OCoLC)1228581843</subfield><subfield code="z">(OCoLC)1286907195</subfield></datafield><datafield tag="037" ind1=" " ind2=" "><subfield code="a">134155</subfield><subfield code="b">MIL</subfield></datafield><datafield tag="037" ind1=" " ind2=" "><subfield code="b">CRKN/MyiLibrary</subfield><subfield code="c">CostDepend</subfield><subfield code="f">FormOnline</subfield><subfield code="g">AccessRestricted</subfield><subfield code="n">GovNo</subfield></datafield><datafield tag="050" ind1=" " ind2="4"><subfield code="a">QA95</subfield><subfield code="b">.H54 2007eb</subfield></datafield><datafield tag="055" ind1="1" ind2="3"><subfield code="a">QA95</subfield><subfield code="b">.H54 2007eb</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">MAT</subfield><subfield code="x">023000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">MAT</subfield><subfield code="x">026000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">MAT</subfield><subfield code="x">039000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="082" ind1="7" ind2=" "><subfield code="a">510</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">Higgins, Peter M.,</subfield><subfield code="d">1956-</subfield><subfield code="1">https://id.oclc.org/worldcat/entity/E39PCjxmgFY7jkV3Ckcq9DfF83</subfield><subfield code="0">http://id.loc.gov/authorities/names/n85386266</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Nets, puzzles, and postmen /</subfield><subfield code="c">Peter M. Higgins.</subfield></datafield><datafield tag="260" ind1=" " ind2=" "><subfield code="a">Oxford ;</subfield><subfield code="a">New York :</subfield><subfield code="b">Oxford University Press,</subfield><subfield code="c">2007.</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (viii, 247 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="504" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references (pages 236-241) 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">Nets, trees, and lies -- Trees -- Chemical isomers -- Lying liars and the lies they tell -- Trees and games of logic -- Familiar logic games -- Exotic squares and Sudoku -- The nature of nets -- The small world phenomenon -- The bridges of Ko?nigsberg -- Hand-shaking and its consequences -- Cycles that take you on a tour -- Party problems -- Colouring and planarity -- The four-colour map problem -- How edges can ruin planarity -- Rabbits out of hats: guarding the gallery ; innocent questions of points and lines ; Brouwer's fixed point theorem -- How to traverse a network -- The Euler-Fleury method -- The Chinese postman problem -- One-way systems -- Nets that remember where you have been -- Nets as machines -- Automata with something to say -- Lattices -- Spanning networks -- Sorting the traffic -- Greedy salesmen -- Finding the quick route -- The P versus NP controversy -- Going with the flow -- Network capacities and finding suitable boys -- Marriage and other problems -- Harems, maximum flows, and other things -- Novel applications of nets -- Instant insanity -- Sharing the wine -- Jealousy problems -- Mazes and labyrinths -- Trees and codes -- Reassembling RNA chains -- For connoisseurs.</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">What do railways, mingling at parties, mazes, and the internet all have in common? All are networks - people or places or things that connect to one another. Peter Higgins shows that these phenomena - and many more - are underpinned by the same deep mathematical structure, and how this understanding gives us remarkable new insights into the world. - ;What do road and railway systems, electrical circuits, mingling at parties, mazes, family trees, and the internet all have in common?. All are networks - either people or places or things that relate and connect to one another. Only relatively rec.</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">Mathematical recreations.</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh85082131</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Mathematics</subfield><subfield code="v">Popular works.</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">Jeux mathématiques.</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Mathématiques</subfield><subfield code="v">Ouvrages de vulgarisation.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">MATHEMATICS</subfield><subfield code="x">Pre-Calculus.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">MATHEMATICS</subfield><subfield code="x">Reference.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">MATHEMATICS</subfield><subfield code="x">Essays.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Mathematical recreations</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Mathematics</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="655" ind1=" " ind2="0"><subfield code="a">Electronic books.</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="a">Popular works</subfield><subfield code="2">fast</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Print version:</subfield><subfield code="a">Higgins, Peter M., 1956-</subfield><subfield code="t">Nets, puzzles, and postmen.</subfield><subfield code="d">Oxford ; New York : Oxford University Press, 2007</subfield><subfield code="z">0199218420</subfield><subfield code="z">9780199218424</subfield><subfield code="w">(DLC) 2008295526</subfield><subfield code="w">(OCoLC)163311946</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=223875</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">20451207</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">ebrary</subfield><subfield code="b">EBRY</subfield><subfield code="n">ebr10225222</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">EBSCOhost</subfield><subfield code="b">EBSC</subfield><subfield code="n">223875</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">ProQuest MyiLibrary Digital eBook Collection</subfield><subfield code="b">IDEB</subfield><subfield code="n">134155</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">2816885</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">2875369</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> |
| genre | Electronic books. Popular works fast |
| genre_facet | Electronic books. Popular works |
| id | ZDB-4-EBA-ocn227008323 |
| illustrated | Illustrated |
| indexdate | 2024-11-27T13:16:19Z |
| institution | BVB |
| isbn | 9780191551161 0191551163 9786611341558 6611341552 |
| language | English |
| oclc_num | 227008323 |
| open_access_boolean | |
| owner | MAIN DE-863 DE-BY-FWS |
| owner_facet | MAIN DE-863 DE-BY-FWS |
| physical | 1 online resource (viii, 247 pages) : illustrations |
| psigel | ZDB-4-EBA |
| publishDate | 2007 |
| publishDateSearch | 2007 |
| publishDateSort | 2007 |
| publisher | Oxford University Press, |
| record_format | marc |
| spelling | Higgins, Peter M., 1956- https://id.oclc.org/worldcat/entity/E39PCjxmgFY7jkV3Ckcq9DfF83 http://id.loc.gov/authorities/names/n85386266 Nets, puzzles, and postmen / Peter M. Higgins. Oxford ; New York : Oxford University Press, 2007. 1 online resource (viii, 247 pages) : illustrations text txt rdacontent computer c rdamedia online resource cr rdacarrier Includes bibliographical references (pages 236-241) and index. Print version record. Nets, trees, and lies -- Trees -- Chemical isomers -- Lying liars and the lies they tell -- Trees and games of logic -- Familiar logic games -- Exotic squares and Sudoku -- The nature of nets -- The small world phenomenon -- The bridges of Ko?nigsberg -- Hand-shaking and its consequences -- Cycles that take you on a tour -- Party problems -- Colouring and planarity -- The four-colour map problem -- How edges can ruin planarity -- Rabbits out of hats: guarding the gallery ; innocent questions of points and lines ; Brouwer's fixed point theorem -- How to traverse a network -- The Euler-Fleury method -- The Chinese postman problem -- One-way systems -- Nets that remember where you have been -- Nets as machines -- Automata with something to say -- Lattices -- Spanning networks -- Sorting the traffic -- Greedy salesmen -- Finding the quick route -- The P versus NP controversy -- Going with the flow -- Network capacities and finding suitable boys -- Marriage and other problems -- Harems, maximum flows, and other things -- Novel applications of nets -- Instant insanity -- Sharing the wine -- Jealousy problems -- Mazes and labyrinths -- Trees and codes -- Reassembling RNA chains -- For connoisseurs. What do railways, mingling at parties, mazes, and the internet all have in common? All are networks - people or places or things that connect to one another. Peter Higgins shows that these phenomena - and many more - are underpinned by the same deep mathematical structure, and how this understanding gives us remarkable new insights into the world. - ;What do road and railway systems, electrical circuits, mingling at parties, mazes, family trees, and the internet all have in common?. All are networks - either people or places or things that relate and connect to one another. Only relatively rec. Nets (Mathematics) http://id.loc.gov/authorities/subjects/sh85091044 Mathematical recreations. http://id.loc.gov/authorities/subjects/sh85082131 Mathematics Popular works. Réseaux (Mathématiques) Jeux mathématiques. Mathématiques Ouvrages de vulgarisation. MATHEMATICS Pre-Calculus. bisacsh MATHEMATICS Reference. bisacsh MATHEMATICS Essays. bisacsh Mathematical recreations fast Mathematics fast Nets (Mathematics) fast Electronic books. Popular works fast Print version: Higgins, Peter M., 1956- Nets, puzzles, and postmen. Oxford ; New York : Oxford University Press, 2007 0199218420 9780199218424 (DLC) 2008295526 (OCoLC)163311946 FWS01 ZDB-4-EBA FWS_PDA_EBA https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=223875 Volltext |
| spellingShingle | Higgins, Peter M., 1956- Nets, puzzles, and postmen / Nets, trees, and lies -- Trees -- Chemical isomers -- Lying liars and the lies they tell -- Trees and games of logic -- Familiar logic games -- Exotic squares and Sudoku -- The nature of nets -- The small world phenomenon -- The bridges of Ko?nigsberg -- Hand-shaking and its consequences -- Cycles that take you on a tour -- Party problems -- Colouring and planarity -- The four-colour map problem -- How edges can ruin planarity -- Rabbits out of hats: guarding the gallery ; innocent questions of points and lines ; Brouwer's fixed point theorem -- How to traverse a network -- The Euler-Fleury method -- The Chinese postman problem -- One-way systems -- Nets that remember where you have been -- Nets as machines -- Automata with something to say -- Lattices -- Spanning networks -- Sorting the traffic -- Greedy salesmen -- Finding the quick route -- The P versus NP controversy -- Going with the flow -- Network capacities and finding suitable boys -- Marriage and other problems -- Harems, maximum flows, and other things -- Novel applications of nets -- Instant insanity -- Sharing the wine -- Jealousy problems -- Mazes and labyrinths -- Trees and codes -- Reassembling RNA chains -- For connoisseurs. Nets (Mathematics) http://id.loc.gov/authorities/subjects/sh85091044 Mathematical recreations. http://id.loc.gov/authorities/subjects/sh85082131 Mathematics Popular works. Réseaux (Mathématiques) Jeux mathématiques. Mathématiques Ouvrages de vulgarisation. MATHEMATICS Pre-Calculus. bisacsh MATHEMATICS Reference. bisacsh MATHEMATICS Essays. bisacsh Mathematical recreations fast Mathematics fast Nets (Mathematics) fast |
| subject_GND | http://id.loc.gov/authorities/subjects/sh85091044 http://id.loc.gov/authorities/subjects/sh85082131 |
| title | Nets, puzzles, and postmen / |
| title_auth | Nets, puzzles, and postmen / |
| title_exact_search | Nets, puzzles, and postmen / |
| title_full | Nets, puzzles, and postmen / Peter M. Higgins. |
| title_fullStr | Nets, puzzles, and postmen / Peter M. Higgins. |
| title_full_unstemmed | Nets, puzzles, and postmen / Peter M. Higgins. |
| title_short | Nets, puzzles, and postmen / |
| title_sort | nets puzzles and postmen |
| topic | Nets (Mathematics) http://id.loc.gov/authorities/subjects/sh85091044 Mathematical recreations. http://id.loc.gov/authorities/subjects/sh85082131 Mathematics Popular works. Réseaux (Mathématiques) Jeux mathématiques. Mathématiques Ouvrages de vulgarisation. MATHEMATICS Pre-Calculus. bisacsh MATHEMATICS Reference. bisacsh MATHEMATICS Essays. bisacsh Mathematical recreations fast Mathematics fast Nets (Mathematics) fast |
| topic_facet | Nets (Mathematics) Mathematical recreations. Mathematics Popular works. Réseaux (Mathématiques) Jeux mathématiques. Mathématiques Ouvrages de vulgarisation. MATHEMATICS Pre-Calculus. MATHEMATICS Reference. MATHEMATICS Essays. Mathematical recreations Mathematics Electronic books. Popular works |
| url | https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=223875 |
| work_keys_str_mv | AT higginspeterm netspuzzlesandpostmen |