The complexity of the maximum network flow problem:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Cambridge, Mass.
Massachusetts Inst. of Technology, Laboratory for Computer Science
1980
|
| Schlagworte: | |
| Beschreibung: | 68 Bl. graph. Darst. |
Internformat
MARC
| LEADER | 00000nam a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV021876324 | ||
| 003 | DE-604 | ||
| 005 | 20100728 | ||
| 007 | t | ||
| 008 | 880304s1980 d||| |||| 00||| eng d | ||
| 035 | |a (OCoLC)6216868 | ||
| 035 | |a (DE-599)BVBBV021876324 | ||
| 040 | |a DE-604 |b ger | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-706 |a DE-634 | ||
| 050 | 0 | |a QA76 | |
| 082 | 0 | |a 510.782 | |
| 088 | |a MIT-LCS-TR-230 | ||
| 100 | 1 | |a Baratz, Alan Edward |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a The complexity of the maximum network flow problem |c Alan Edward Baratz |
| 264 | 1 | |a Cambridge, Mass. |b Massachusetts Inst. of Technology, Laboratory for Computer Science |c 1980 | |
| 300 | |a 68 Bl. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 650 | 4 | |a Analyse de réseau (Planification) | |
| 650 | 4 | |a Complexité de calcul (Informatique) | |
| 650 | 4 | |a Algorithms | |
| 650 | 4 | |a Computer networks | |
| 650 | 0 | 7 | |a Netzplantechnik |0 (DE-588)4075297-5 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Netzplantechnik |0 (DE-588)4075297-5 |D s |
| 689 | 0 | |5 DE-604 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-015091944 | ||
Datensatz im Suchindex
| _version_ | 1804135815788363776 |
|---|---|
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author | Baratz, Alan Edward |
| author_facet | Baratz, Alan Edward |
| author_role | aut |
| author_sort | Baratz, Alan Edward |
| author_variant | a e b ae aeb |
| building | Verbundindex |
| bvnumber | BV021876324 |
| callnumber-first | Q - Science |
| callnumber-label | QA76 |
| callnumber-raw | QA76 |
| callnumber-search | QA76 |
| callnumber-sort | QA 276 |
| callnumber-subject | QA - Mathematics |
| ctrlnum | (OCoLC)6216868 (DE-599)BVBBV021876324 |
| dewey-full | 510.782 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 510 - Mathematics |
| dewey-raw | 510.782 |
| dewey-search | 510.782 |
| dewey-sort | 3510.782 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| discipline_str_mv | Mathematik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01130nam a2200361zc 4500</leader><controlfield tag="001">BV021876324</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20100728 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">880304s1980 d||| |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)6216868</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV021876324</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><subfield code="a">DE-634</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA76</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">510.782</subfield></datafield><datafield tag="088" ind1=" " ind2=" "><subfield code="a">MIT-LCS-TR-230</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Baratz, Alan Edward</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">The complexity of the maximum network flow problem</subfield><subfield code="c">Alan Edward Baratz</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge, Mass.</subfield><subfield code="b">Massachusetts Inst. of Technology, Laboratory for Computer Science</subfield><subfield code="c">1980</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">68 Bl.</subfield><subfield code="b">graph. Darst.</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">Analyse de réseau (Planification)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Complexité de calcul (Informatique)</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">Netzplantechnik</subfield><subfield code="0">(DE-588)4075297-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Netzplantechnik</subfield><subfield code="0">(DE-588)4075297-5</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-015091944</subfield></datafield></record></collection> |
| id | DE-604.BV021876324 |
| illustrated | Illustrated |
| index_date | 2024-07-02T16:03:36Z |
| indexdate | 2024-07-09T20:46:30Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-015091944 |
| oclc_num | 6216868 |
| open_access_boolean | |
| owner | DE-706 DE-634 |
| owner_facet | DE-706 DE-634 |
| physical | 68 Bl. graph. Darst. |
| publishDate | 1980 |
| publishDateSearch | 1980 |
| publishDateSort | 1980 |
| publisher | Massachusetts Inst. of Technology, Laboratory for Computer Science |
| record_format | marc |
| spelling | Baratz, Alan Edward Verfasser aut The complexity of the maximum network flow problem Alan Edward Baratz Cambridge, Mass. Massachusetts Inst. of Technology, Laboratory for Computer Science 1980 68 Bl. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Analyse de réseau (Planification) Complexité de calcul (Informatique) Algorithms Computer networks Netzplantechnik (DE-588)4075297-5 gnd rswk-swf Netzplantechnik (DE-588)4075297-5 s DE-604 |
| spellingShingle | Baratz, Alan Edward The complexity of the maximum network flow problem Analyse de réseau (Planification) Complexité de calcul (Informatique) Algorithms Computer networks Netzplantechnik (DE-588)4075297-5 gnd |
| subject_GND | (DE-588)4075297-5 |
| title | The complexity of the maximum network flow problem |
| title_auth | The complexity of the maximum network flow problem |
| title_exact_search | The complexity of the maximum network flow problem |
| title_exact_search_txtP | The complexity of the maximum network flow problem |
| title_full | The complexity of the maximum network flow problem Alan Edward Baratz |
| title_fullStr | The complexity of the maximum network flow problem Alan Edward Baratz |
| title_full_unstemmed | The complexity of the maximum network flow problem Alan Edward Baratz |
| title_short | The complexity of the maximum network flow problem |
| title_sort | the complexity of the maximum network flow problem |
| topic | Analyse de réseau (Planification) Complexité de calcul (Informatique) Algorithms Computer networks Netzplantechnik (DE-588)4075297-5 gnd |
| topic_facet | Analyse de réseau (Planification) Complexité de calcul (Informatique) Algorithms Computer networks Netzplantechnik |
| work_keys_str_mv | AT baratzalanedward thecomplexityofthemaximumnetworkflowproblem |