Network flow algorithms:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Cambridge, United Kingdom ; New York, USA ; Port Melbourne, Australia ; New Delhi, India ; Singapore
Cambridge University Press
2019
|
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Beschreibung: | Literaturangaben: Seite 294-306 Includes bibliographical references and index |
| Beschreibung: | xii, 314 Seiten Illustrationen, Diagramme |
| ISBN: | 9781316636831 9781107185890 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV046320182 | ||
| 003 | DE-604 | ||
| 005 | 20220621 | ||
| 007 | t | ||
| 008 | 200107s2019 xxka||| |||| 00||| eng d | ||
| 020 | |a 9781316636831 |c paperback |9 978-1-316-63683-1 | ||
| 020 | |a 9781107185890 |c hardback |9 978-1-107-18589-0 | ||
| 035 | |a (OCoLC)1158578587 | ||
| 035 | |a (DE-599)KXP1664750894 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 044 | |a xxk |c XA-GB |a xxu |c XD-US | ||
| 049 | |a DE-91G |a DE-384 |a DE-83 | ||
| 050 | 0 | |a T57.85 | |
| 082 | 0 | |a 003 | |
| 084 | |a ST 132 |0 (DE-625)143589: |2 rvk | ||
| 084 | |a SK 890 |0 (DE-625)143267: |2 rvk | ||
| 084 | |a MAT 904f |2 stub | ||
| 100 | 1 | |a Williamson, David P. |d 1967- |e Verfasser |0 (DE-588)1013297776 |4 aut | |
| 245 | 1 | 0 | |a Network flow algorithms |c David P. Williamson |
| 264 | 1 | |a Cambridge, United Kingdom ; New York, USA ; Port Melbourne, Australia ; New Delhi, India ; Singapore |b Cambridge University Press |c 2019 | |
| 300 | |a xii, 314 Seiten |b Illustrationen, Diagramme | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 500 | |a Literaturangaben: Seite 294-306 | ||
| 500 | |a Includes bibliographical references and index | ||
| 650 | 0 | 7 | |a Optimierung |0 (DE-588)4043664-0 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Netzwerkfluss |0 (DE-588)4126130-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 653 | 0 | |a Network analysis (Planning) / Computer programs | |
| 653 | 0 | |a System theory | |
| 653 | 0 | |a Computer algorithms | |
| 689 | 0 | 0 | |a Netzwerkfluss |0 (DE-588)4126130-6 |D s |
| 689 | 0 | 1 | |a Optimierung |0 (DE-588)4043664-0 |D s |
| 689 | 0 | 2 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 0 | |5 DE-604 | |
| 776 | 0 | 8 | |i Erscheint auch als |n Online-Ausgabe |o 978-1-316-88856-8 |
| 856 | 4 | 1 | |u http://www.networkflowalgs.com/ |x Verlag |z kostenfrei |3 Volltext |
| 912 | |a ebook | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-031697215 | ||
Datensatz im Suchindex
| _version_ | 1804180801881899008 |
|---|---|
| any_adam_object | |
| author | Williamson, David P. 1967- |
| author_GND | (DE-588)1013297776 |
| author_facet | Williamson, David P. 1967- |
| author_role | aut |
| author_sort | Williamson, David P. 1967- |
| author_variant | d p w dp dpw |
| building | Verbundindex |
| bvnumber | BV046320182 |
| callnumber-first | T - Technology |
| callnumber-label | T57 |
| callnumber-raw | T57.85 |
| callnumber-search | T57.85 |
| callnumber-sort | T 257.85 |
| callnumber-subject | T - General Technology |
| classification_rvk | ST 132 SK 890 |
| classification_tum | MAT 904f |
| collection | ebook |
| ctrlnum | (OCoLC)1158578587 (DE-599)KXP1664750894 |
| dewey-full | 003 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 003 - Systems |
| dewey-raw | 003 |
| dewey-search | 003 |
| dewey-sort | 13 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik Mathematik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01918nam a2200517 c 4500</leader><controlfield tag="001">BV046320182</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20220621 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">200107s2019 xxka||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781316636831</subfield><subfield code="c">paperback</subfield><subfield code="9">978-1-316-63683-1</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781107185890</subfield><subfield code="c">hardback</subfield><subfield code="9">978-1-107-18589-0</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1158578587</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)KXP1664750894</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">xxk</subfield><subfield code="c">XA-GB</subfield><subfield code="a">xxu</subfield><subfield code="c">XD-US</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-83</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">T57.85</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">003</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 132</subfield><subfield code="0">(DE-625)143589:</subfield><subfield code="2">rvk</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">MAT 904f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Williamson, David P.</subfield><subfield code="d">1967-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1013297776</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Network flow algorithms</subfield><subfield code="c">David P. Williamson</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge, United Kingdom ; New York, USA ; Port Melbourne, Australia ; New Delhi, India ; Singapore</subfield><subfield code="b">Cambridge University Press</subfield><subfield code="c">2019</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">xii, 314 Seiten</subfield><subfield code="b">Illustrationen, Diagramme</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="500" ind1=" " ind2=" "><subfield code="a">Literaturangaben: Seite 294-306</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references and index</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Optimierung</subfield><subfield code="0">(DE-588)4043664-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Netzwerkfluss</subfield><subfield code="0">(DE-588)4126130-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Network analysis (Planning) / Computer programs</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">System theory</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Computer algorithms</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Netzwerkfluss</subfield><subfield code="0">(DE-588)4126130-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Optimierung</subfield><subfield code="0">(DE-588)4043664-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Online-Ausgabe</subfield><subfield code="o">978-1-316-88856-8</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">http://www.networkflowalgs.com/</subfield><subfield code="x">Verlag</subfield><subfield code="z">kostenfrei</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ebook</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-031697215</subfield></datafield></record></collection> |
| id | DE-604.BV046320182 |
| illustrated | Illustrated |
| indexdate | 2024-07-10T08:41:32Z |
| institution | BVB |
| isbn | 9781316636831 9781107185890 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-031697215 |
| oclc_num | 1158578587 |
| open_access_boolean | 1 |
| owner | DE-91G DE-BY-TUM DE-384 DE-83 |
| owner_facet | DE-91G DE-BY-TUM DE-384 DE-83 |
| physical | xii, 314 Seiten Illustrationen, Diagramme |
| psigel | ebook |
| publishDate | 2019 |
| publishDateSearch | 2019 |
| publishDateSort | 2019 |
| publisher | Cambridge University Press |
| record_format | marc |
| spelling | Williamson, David P. 1967- Verfasser (DE-588)1013297776 aut Network flow algorithms David P. Williamson Cambridge, United Kingdom ; New York, USA ; Port Melbourne, Australia ; New Delhi, India ; Singapore Cambridge University Press 2019 xii, 314 Seiten Illustrationen, Diagramme txt rdacontent n rdamedia nc rdacarrier Literaturangaben: Seite 294-306 Includes bibliographical references and index Optimierung (DE-588)4043664-0 gnd rswk-swf Netzwerkfluss (DE-588)4126130-6 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf Network analysis (Planning) / Computer programs System theory Computer algorithms Netzwerkfluss (DE-588)4126130-6 s Optimierung (DE-588)4043664-0 s Algorithmus (DE-588)4001183-5 s DE-604 Erscheint auch als Online-Ausgabe 978-1-316-88856-8 http://www.networkflowalgs.com/ Verlag kostenfrei Volltext |
| spellingShingle | Williamson, David P. 1967- Network flow algorithms Optimierung (DE-588)4043664-0 gnd Netzwerkfluss (DE-588)4126130-6 gnd Algorithmus (DE-588)4001183-5 gnd |
| subject_GND | (DE-588)4043664-0 (DE-588)4126130-6 (DE-588)4001183-5 |
| title | Network flow algorithms |
| title_auth | Network flow algorithms |
| title_exact_search | Network flow algorithms |
| title_full | Network flow algorithms David P. Williamson |
| title_fullStr | Network flow algorithms David P. Williamson |
| title_full_unstemmed | Network flow algorithms David P. Williamson |
| title_short | Network flow algorithms |
| title_sort | network flow algorithms |
| topic | Optimierung (DE-588)4043664-0 gnd Netzwerkfluss (DE-588)4126130-6 gnd Algorithmus (DE-588)4001183-5 gnd |
| topic_facet | Optimierung Netzwerkfluss Algorithmus |
| url | http://www.networkflowalgs.com/ |
| work_keys_str_mv | AT williamsondavidp networkflowalgorithms |