Construction and analysis of network flow problem which forces Karzanov algorithm to 0 (n 3) running time:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Cambridge, Mass.
Mass. Inst. of Technology, Laboratory for Computer Science
1977
|
| Schlagworte: | |
| Beschreibung: | 17 S. |
Internformat
MARC
| LEADER | 00000nam a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV021882192 | ||
| 003 | DE-604 | ||
| 005 | 20070725 | ||
| 007 | t | ||
| 008 | 890118s1977 |||| 00||| eng d | ||
| 035 | |a (OCoLC)3299568 | ||
| 035 | |a (DE-599)BVBBV021882192 | ||
| 040 | |a DE-604 |b ger | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-706 | ||
| 050 | 0 | |a QA9.58 | |
| 088 | |a MIT/LCS/TM-83 | ||
| 100 | 1 | |a Baratz, Alan E. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Construction and analysis of network flow problem which forces Karzanov algorithm to 0 (n 3) running time |
| 264 | 1 | |a Cambridge, Mass. |b Mass. Inst. of Technology, Laboratory for Computer Science |c 1977 | |
| 300 | |a 17 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 650 | 4 | |a Algorithms | |
| 650 | 4 | |a Computer networks | |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 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 |
| 689 | 0 | 0 | |a Algorithmus |0 (DE-588)4001183-5 |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-015097553 | ||
Datensatz im Suchindex
| _version_ | 1804135822980546560 |
|---|---|
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author | Baratz, Alan E. |
| author_facet | Baratz, Alan E. |
| author_role | aut |
| author_sort | Baratz, Alan E. |
| author_variant | a e b ae aeb |
| building | Verbundindex |
| bvnumber | BV021882192 |
| 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)3299568 (DE-599)BVBBV021882192 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01206nam a2200373zc 4500</leader><controlfield tag="001">BV021882192</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20070725 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">890118s1977 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)3299568</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV021882192</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-83</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Baratz, Alan E.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Construction and analysis of network flow problem which forces Karzanov algorithm to 0 (n 3) running time</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">1977</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">17 S.</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=" " ind2="4"><subfield code="a">Computer networks</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="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="689" ind1="0" ind2="0"><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="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-015097553</subfield></datafield></record></collection> |
| id | DE-604.BV021882192 |
| 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-015097553 |
| oclc_num | 3299568 |
| open_access_boolean | |
| owner | DE-706 |
| owner_facet | DE-706 |
| physical | 17 S. |
| publishDate | 1977 |
| publishDateSearch | 1977 |
| publishDateSort | 1977 |
| publisher | Mass. Inst. of Technology, Laboratory for Computer Science |
| record_format | marc |
| spelling | Baratz, Alan E. Verfasser aut Construction and analysis of network flow problem which forces Karzanov algorithm to 0 (n 3) running time Cambridge, Mass. Mass. Inst. of Technology, Laboratory for Computer Science 1977 17 S. txt rdacontent n rdamedia nc rdacarrier Algorithms Computer networks Algorithmus (DE-588)4001183-5 gnd rswk-swf Datenfluss (DE-588)4191571-9 gnd rswk-swf Netzwerk (DE-588)4171529-9 gnd rswk-swf Algorithmus (DE-588)4001183-5 s Netzwerk (DE-588)4171529-9 s Datenfluss (DE-588)4191571-9 s DE-604 |
| spellingShingle | Baratz, Alan E. Construction and analysis of network flow problem which forces Karzanov algorithm to 0 (n 3) running time Algorithms Computer networks Algorithmus (DE-588)4001183-5 gnd Datenfluss (DE-588)4191571-9 gnd Netzwerk (DE-588)4171529-9 gnd |
| subject_GND | (DE-588)4001183-5 (DE-588)4191571-9 (DE-588)4171529-9 |
| title | Construction and analysis of network flow problem which forces Karzanov algorithm to 0 (n 3) running time |
| title_auth | Construction and analysis of network flow problem which forces Karzanov algorithm to 0 (n 3) running time |
| title_exact_search | Construction and analysis of network flow problem which forces Karzanov algorithm to 0 (n 3) running time |
| title_exact_search_txtP | Construction and analysis of network flow problem which forces Karzanov algorithm to 0 (n 3) running time |
| title_full | Construction and analysis of network flow problem which forces Karzanov algorithm to 0 (n 3) running time |
| title_fullStr | Construction and analysis of network flow problem which forces Karzanov algorithm to 0 (n 3) running time |
| title_full_unstemmed | Construction and analysis of network flow problem which forces Karzanov algorithm to 0 (n 3) running time |
| title_short | Construction and analysis of network flow problem which forces Karzanov algorithm to 0 (n 3) running time |
| title_sort | construction and analysis of network flow problem which forces karzanov algorithm to 0 n 3 running time |
| topic | Algorithms Computer networks Algorithmus (DE-588)4001183-5 gnd Datenfluss (DE-588)4191571-9 gnd Netzwerk (DE-588)4171529-9 gnd |
| topic_facet | Algorithms Computer networks Algorithmus Datenfluss Netzwerk |
| work_keys_str_mv | AT baratzalane constructionandanalysisofnetworkflowproblemwhichforceskarzanovalgorithmto0n3runningtime |