Linear time algorithm for minimum network partition:
Gespeichert in:
| Beteilige Person: | |
|---|---|
| Format: | Buch |
| Sprache: | Englisch |
| Veröffentlicht: |
Cambridge, Mass.
Lab. for Computer Science, Massachusetts Inst. of Technology
1988
|
| Schlagwörter: | |
| Umfang: | 4 S. |
Internformat
MARC
| LEADER | 00000nam a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV021892138 | ||
| 003 | DE-604 | ||
| 005 | 20040301000000.0 | ||
| 007 | t| | ||
| 008 | 900726s1988 xx |||| 00||| eng d | ||
| 035 | |a (OCoLC)18484058 | ||
| 035 | |a (DE-599)BVBBV021892138 | ||
| 040 | |a DE-604 |b ger | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-706 | ||
| 050 | 0 | |a QA76.M41 | |
| 088 | |a MIT/LCS/TM-350 | ||
| 100 | 1 | |a Awerbuch, Baruch |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Linear time algorithm for minimum network partition |
| 264 | 1 | |a Cambridge, Mass. |b Lab. for Computer Science, Massachusetts Inst. of Technology |c 1988 | |
| 300 | |a 4 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 650 | 4 | |a Datenverarbeitung | |
| 650 | 4 | |a Algorithms | |
| 650 | 4 | |a Computer networks | |
| 650 | 4 | |a Electronic data processing |x Distributed processing | |
| 650 | 0 | 7 | |a Kommunikation |0 (DE-588)4031883-7 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Netzwerk |0 (DE-588)4171529-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Kommunikation |0 (DE-588)4031883-7 |D s |
| 689 | 1 | |5 DE-604 | |
| 689 | 2 | 0 | |a Netzwerk |0 (DE-588)4171529-9 |D s |
| 689 | 2 | |5 DE-604 | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-015107336 | |
Datensatz im Suchindex
| _version_ | 1818963377801658368 |
|---|---|
| any_adam_object | |
| author | Awerbuch, Baruch |
| author_facet | Awerbuch, Baruch |
| author_role | aut |
| author_sort | Awerbuch, Baruch |
| author_variant | b a ba |
| building | Verbundindex |
| bvnumber | BV021892138 |
| callnumber-first | Q - Science |
| callnumber-label | QA76 |
| callnumber-raw | QA76.M41 |
| callnumber-search | QA76.M41 |
| callnumber-sort | QA 276 M41 |
| callnumber-subject | QA - Mathematics |
| ctrlnum | (OCoLC)18484058 (DE-599)BVBBV021892138 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01312nam a2200421zc 4500</leader><controlfield tag="001">BV021892138</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20040301000000.0</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">900726s1988 xx |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)18484058</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV021892138</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">QA76.M41</subfield></datafield><datafield tag="088" ind1=" " ind2=" "><subfield code="a">MIT/LCS/TM-350</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Awerbuch, Baruch</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Linear time algorithm for minimum network partition</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge, Mass.</subfield><subfield code="b">Lab. for Computer Science, Massachusetts Inst. of Technology</subfield><subfield code="c">1988</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">4 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">Datenverarbeitung</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=" " ind2="4"><subfield code="a">Electronic data processing</subfield><subfield code="x">Distributed processing</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Kommunikation</subfield><subfield code="0">(DE-588)4031883-7</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">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</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=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Kommunikation</subfield><subfield code="0">(DE-588)4031883-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" ind2="0"><subfield code="a">Netzwerk</subfield><subfield code="0">(DE-588)4171529-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-015107336</subfield></datafield></record></collection> |
| id | DE-604.BV021892138 |
| illustrated | Not Illustrated |
| indexdate | 2024-12-20T12:44:15Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-015107336 |
| oclc_num | 18484058 |
| open_access_boolean | |
| owner | DE-706 |
| owner_facet | DE-706 |
| physical | 4 S. |
| publishDate | 1988 |
| publishDateSearch | 1988 |
| publishDateSort | 1988 |
| publisher | Lab. for Computer Science, Massachusetts Inst. of Technology |
| record_format | marc |
| spelling | Awerbuch, Baruch Verfasser aut Linear time algorithm for minimum network partition Cambridge, Mass. Lab. for Computer Science, Massachusetts Inst. of Technology 1988 4 S. txt rdacontent n rdamedia nc rdacarrier Datenverarbeitung Algorithms Computer networks Electronic data processing Distributed processing Kommunikation (DE-588)4031883-7 gnd rswk-swf Netzwerk (DE-588)4171529-9 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf Algorithmus (DE-588)4001183-5 s DE-604 Kommunikation (DE-588)4031883-7 s Netzwerk (DE-588)4171529-9 s |
| spellingShingle | Awerbuch, Baruch Linear time algorithm for minimum network partition Datenverarbeitung Algorithms Computer networks Electronic data processing Distributed processing Kommunikation (DE-588)4031883-7 gnd Netzwerk (DE-588)4171529-9 gnd Algorithmus (DE-588)4001183-5 gnd |
| subject_GND | (DE-588)4031883-7 (DE-588)4171529-9 (DE-588)4001183-5 |
| title | Linear time algorithm for minimum network partition |
| title_auth | Linear time algorithm for minimum network partition |
| title_exact_search | Linear time algorithm for minimum network partition |
| title_full | Linear time algorithm for minimum network partition |
| title_fullStr | Linear time algorithm for minimum network partition |
| title_full_unstemmed | Linear time algorithm for minimum network partition |
| title_short | Linear time algorithm for minimum network partition |
| title_sort | linear time algorithm for minimum network partition |
| topic | Datenverarbeitung Algorithms Computer networks Electronic data processing Distributed processing Kommunikation (DE-588)4031883-7 gnd Netzwerk (DE-588)4171529-9 gnd Algorithmus (DE-588)4001183-5 gnd |
| topic_facet | Datenverarbeitung Algorithms Computer networks Electronic data processing Distributed processing Kommunikation Netzwerk Algorithmus |
| work_keys_str_mv | AT awerbuchbaruch lineartimealgorithmforminimumnetworkpartition |