Shortest-path algorithms with decentralized information and communication requirements:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
1981
|
| Schlagworte: | |
| Beschreibung: | Saint Louis, Mo., Univ., Diss., 1981. -Kopie, erschienen im Verl. Univ. Microfilms Internat., Ann Arbor, Mich. |
| Beschreibung: | VIII, 175 S. graph. Darst. |
Internformat
MARC
| LEADER | 00000nam a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV021894161 | ||
| 003 | DE-604 | ||
| 005 | 20060120000000.0 | ||
| 007 | t | ||
| 008 | 901115s1981 d||| m||| 00||| eng d | ||
| 035 | |a (OCoLC)7887836 | ||
| 035 | |a (DE-599)BVBBV021894161 | ||
| 040 | |a DE-604 |b ger | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-706 | ||
| 100 | 1 | |a Abram, Jeffrey M. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Shortest-path algorithms with decentralized information and communication requirements |c by Jeffrey M. Abram |
| 264 | 1 | |c 1981 | |
| 300 | |a VIII, 175 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 500 | |a Saint Louis, Mo., Univ., Diss., 1981. -Kopie, erschienen im Verl. Univ. Microfilms Internat., Ann Arbor, Mich. | ||
| 650 | 4 | |a Algorithms | |
| 650 | 4 | |a Network analysis (Planning) | |
| 650 | 0 | 7 | |a Kürzester-Weg-Problem |0 (DE-588)4138403-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Verteiltes System |0 (DE-588)4238872-7 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 689 | 0 | 0 | |a Kürzester-Weg-Problem |0 (DE-588)4138403-9 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Verteiltes System |0 (DE-588)4238872-7 |D s |
| 689 | 1 | |5 DE-604 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-015109351 | ||
Datensatz im Suchindex
| _version_ | 1804135838226841600 |
|---|---|
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author | Abram, Jeffrey M. |
| author_facet | Abram, Jeffrey M. |
| author_role | aut |
| author_sort | Abram, Jeffrey M. |
| author_variant | j m a jm jma |
| building | Verbundindex |
| bvnumber | BV021894161 |
| ctrlnum | (OCoLC)7887836 (DE-599)BVBBV021894161 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01256nam a2200361zc 4500</leader><controlfield tag="001">BV021894161</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20060120000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">901115s1981 d||| m||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)7887836</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV021894161</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="100" ind1="1" ind2=" "><subfield code="a">Abram, Jeffrey M.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Shortest-path algorithms with decentralized information and communication requirements</subfield><subfield code="c">by Jeffrey M. Abram</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">1981</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">VIII, 175 S.</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="500" ind1=" " ind2=" "><subfield code="a">Saint Louis, Mo., Univ., Diss., 1981. -Kopie, erschienen im Verl. Univ. Microfilms Internat., Ann Arbor, Mich.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Network analysis (Planning)</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Kürzester-Weg-Problem</subfield><subfield code="0">(DE-588)4138403-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Verteiltes System</subfield><subfield code="0">(DE-588)4238872-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4113937-9</subfield><subfield code="a">Hochschulschrift</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Kürzester-Weg-Problem</subfield><subfield code="0">(DE-588)4138403-9</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">Verteiltes System</subfield><subfield code="0">(DE-588)4238872-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-015109351</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV021894161 |
| illustrated | Illustrated |
| index_date | 2024-07-02T16:04:18Z |
| indexdate | 2024-07-09T20:46:52Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-015109351 |
| oclc_num | 7887836 |
| open_access_boolean | |
| owner | DE-706 |
| owner_facet | DE-706 |
| physical | VIII, 175 S. graph. Darst. |
| publishDate | 1981 |
| publishDateSearch | 1981 |
| publishDateSort | 1981 |
| record_format | marc |
| spelling | Abram, Jeffrey M. Verfasser aut Shortest-path algorithms with decentralized information and communication requirements by Jeffrey M. Abram 1981 VIII, 175 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Saint Louis, Mo., Univ., Diss., 1981. -Kopie, erschienen im Verl. Univ. Microfilms Internat., Ann Arbor, Mich. Algorithms Network analysis (Planning) Kürzester-Weg-Problem (DE-588)4138403-9 gnd rswk-swf Verteiltes System (DE-588)4238872-7 gnd rswk-swf (DE-588)4113937-9 Hochschulschrift gnd-content Kürzester-Weg-Problem (DE-588)4138403-9 s DE-604 Verteiltes System (DE-588)4238872-7 s |
| spellingShingle | Abram, Jeffrey M. Shortest-path algorithms with decentralized information and communication requirements Algorithms Network analysis (Planning) Kürzester-Weg-Problem (DE-588)4138403-9 gnd Verteiltes System (DE-588)4238872-7 gnd |
| subject_GND | (DE-588)4138403-9 (DE-588)4238872-7 (DE-588)4113937-9 |
| title | Shortest-path algorithms with decentralized information and communication requirements |
| title_auth | Shortest-path algorithms with decentralized information and communication requirements |
| title_exact_search | Shortest-path algorithms with decentralized information and communication requirements |
| title_exact_search_txtP | Shortest-path algorithms with decentralized information and communication requirements |
| title_full | Shortest-path algorithms with decentralized information and communication requirements by Jeffrey M. Abram |
| title_fullStr | Shortest-path algorithms with decentralized information and communication requirements by Jeffrey M. Abram |
| title_full_unstemmed | Shortest-path algorithms with decentralized information and communication requirements by Jeffrey M. Abram |
| title_short | Shortest-path algorithms with decentralized information and communication requirements |
| title_sort | shortest path algorithms with decentralized information and communication requirements |
| topic | Algorithms Network analysis (Planning) Kürzester-Weg-Problem (DE-588)4138403-9 gnd Verteiltes System (DE-588)4238872-7 gnd |
| topic_facet | Algorithms Network analysis (Planning) Kürzester-Weg-Problem Verteiltes System Hochschulschrift |
| work_keys_str_mv | AT abramjeffreym shortestpathalgorithmswithdecentralizedinformationandcommunicationrequirements |