The max flow algorithm of Dinic and Karzinov: an exposition
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
Cambridge, Mass.
Mass. Inst. of Technology, Laboratory for Computer Science
1976
|
Schlagworte: | |
Beschreibung: | 13 Bl. |
Internformat
MARC
LEADER | 00000nam a2200000zc 4500 | ||
---|---|---|---|
001 | BV021882199 | ||
003 | DE-604 | ||
005 | 20200925 | ||
007 | t | ||
008 | 890118s1976 |||| 00||| eng d | ||
035 | |a (OCoLC)3195295 | ||
035 | |a (DE-599)BVBBV021882199 | ||
040 | |a DE-604 |b ger | ||
041 | 0 | |a eng | |
049 | |a DE-706 | ||
050 | 0 | |a QA9.58 | |
088 | |a MIT/LCS/TM-80 | ||
100 | 1 | |a Even, Shimon |d 1935-2004 |e Verfasser |0 (DE-588)110882695 |4 aut | |
245 | 1 | 0 | |a The max flow algorithm of Dinic and Karzinov |b an exposition |
264 | 1 | |a Cambridge, Mass. |b Mass. Inst. of Technology, Laboratory for Computer Science |c 1976 | |
300 | |a 13 Bl. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
650 | 4 | |a Algorithms | |
650 | 0 | 7 | |a Datenfluss |0 (DE-588)4191571-9 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Netzwerk |0 (DE-588)4171529-9 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Maximumprinzip |0 (DE-588)4169165-9 |2 gnd |9 rswk-swf |
689 | 0 | 0 | |a Maximumprinzip |0 (DE-588)4169165-9 |D s |
689 | 0 | 1 | |a Netzwerk |0 (DE-588)4171529-9 |D s |
689 | 0 | 2 | |a Datenfluss |0 (DE-588)4191571-9 |D s |
689 | 0 | |5 DE-604 | |
999 | |a oai:aleph.bib-bvb.de:BVB01-015097560 |
Datensatz im Suchindex
_version_ | 1804135822986838016 |
---|---|
adam_txt | |
any_adam_object | |
any_adam_object_boolean | |
author | Even, Shimon 1935-2004 |
author_GND | (DE-588)110882695 |
author_facet | Even, Shimon 1935-2004 |
author_role | aut |
author_sort | Even, Shimon 1935-2004 |
author_variant | s e se |
building | Verbundindex |
bvnumber | BV021882199 |
callnumber-first | Q - Science |
callnumber-label | QA9 |
callnumber-raw | QA9.58 |
callnumber-search | QA9.58 |
callnumber-sort | QA 19.58 |
callnumber-subject | QA - Mathematics |
ctrlnum | (OCoLC)3195295 (DE-599)BVBBV021882199 |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01164nam a2200361zc 4500</leader><controlfield tag="001">BV021882199</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20200925 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">890118s1976 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)3195295</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV021882199</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-706</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA9.58</subfield></datafield><datafield tag="088" ind1=" " ind2=" "><subfield code="a">MIT/LCS/TM-80</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Even, Shimon</subfield><subfield code="d">1935-2004</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)110882695</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">The max flow algorithm of Dinic and Karzinov</subfield><subfield code="b">an exposition</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge, Mass.</subfield><subfield code="b">Mass. Inst. of Technology, Laboratory for Computer Science</subfield><subfield code="c">1976</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">13 Bl.</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="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Datenfluss</subfield><subfield code="0">(DE-588)4191571-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Netzwerk</subfield><subfield code="0">(DE-588)4171529-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Maximumprinzip</subfield><subfield code="0">(DE-588)4169165-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Maximumprinzip</subfield><subfield code="0">(DE-588)4169165-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Netzwerk</subfield><subfield code="0">(DE-588)4171529-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Datenfluss</subfield><subfield code="0">(DE-588)4191571-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-015097560</subfield></datafield></record></collection> |
id | DE-604.BV021882199 |
illustrated | Not Illustrated |
index_date | 2024-07-02T16:03:49Z |
indexdate | 2024-07-09T20:46:37Z |
institution | BVB |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-015097560 |
oclc_num | 3195295 |
open_access_boolean | |
owner | DE-706 |
owner_facet | DE-706 |
physical | 13 Bl. |
publishDate | 1976 |
publishDateSearch | 1976 |
publishDateSort | 1976 |
publisher | Mass. Inst. of Technology, Laboratory for Computer Science |
record_format | marc |
spelling | Even, Shimon 1935-2004 Verfasser (DE-588)110882695 aut The max flow algorithm of Dinic and Karzinov an exposition Cambridge, Mass. Mass. Inst. of Technology, Laboratory for Computer Science 1976 13 Bl. txt rdacontent n rdamedia nc rdacarrier Algorithms Datenfluss (DE-588)4191571-9 gnd rswk-swf Netzwerk (DE-588)4171529-9 gnd rswk-swf Maximumprinzip (DE-588)4169165-9 gnd rswk-swf Maximumprinzip (DE-588)4169165-9 s Netzwerk (DE-588)4171529-9 s Datenfluss (DE-588)4191571-9 s DE-604 |
spellingShingle | Even, Shimon 1935-2004 The max flow algorithm of Dinic and Karzinov an exposition Algorithms Datenfluss (DE-588)4191571-9 gnd Netzwerk (DE-588)4171529-9 gnd Maximumprinzip (DE-588)4169165-9 gnd |
subject_GND | (DE-588)4191571-9 (DE-588)4171529-9 (DE-588)4169165-9 |
title | The max flow algorithm of Dinic and Karzinov an exposition |
title_auth | The max flow algorithm of Dinic and Karzinov an exposition |
title_exact_search | The max flow algorithm of Dinic and Karzinov an exposition |
title_exact_search_txtP | The max flow algorithm of Dinic and Karzinov an exposition |
title_full | The max flow algorithm of Dinic and Karzinov an exposition |
title_fullStr | The max flow algorithm of Dinic and Karzinov an exposition |
title_full_unstemmed | The max flow algorithm of Dinic and Karzinov an exposition |
title_short | The max flow algorithm of Dinic and Karzinov |
title_sort | the max flow algorithm of dinic and karzinov an exposition |
title_sub | an exposition |
topic | Algorithms Datenfluss (DE-588)4191571-9 gnd Netzwerk (DE-588)4171529-9 gnd Maximumprinzip (DE-588)4169165-9 gnd |
topic_facet | Algorithms Datenfluss Netzwerk Maximumprinzip |
work_keys_str_mv | AT evenshimon themaxflowalgorithmofdinicandkarzinovanexposition |