Computing shortest paths between circles:
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Berlin
Dekan des Fachbereichs Informatik
1991
|
| Schriftenreihe: | Informatik-Preprint / Humboldt-Universität zu Berlin, Fachbereich Informatik
11 |
| Beschreibung: | 23 S. graph. Darst. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV025338190 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 100417s1991 d||| |||| 00||| eng d | ||
| 035 | |a (OCoLC)917245078 | ||
| 035 | |a (DE-599)BVBBV025338190 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-11 | ||
| 100 | 1 | |a Rasch, R. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Computing shortest paths between circles |c R. Rasch ; H. Jung. [Humboldt-Universität Berlin, Informatik. Hrsg.: Dekan des Fachbereichs Informatik] |
| 264 | 1 | |a Berlin |b Dekan des Fachbereichs Informatik |c 1991 | |
| 300 | |a 23 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Informatik-Preprint / Humboldt-Universität zu Berlin, Fachbereich Informatik |v 11 | |
| 700 | 1 | |a Jung, Helmut |e Verfasser |4 aut | |
| 810 | 2 | |a Universität <Berlin, Humboldt-Universität> |p Fachbereich Informatik |t Informatik-Preprint |v 11 |w (DE-604)BV024785625 |9 11 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-019966754 | ||
Datensatz im Suchindex
| _version_ | 1804142416232448000 |
|---|---|
| any_adam_object | |
| author | Rasch, R. Jung, Helmut |
| author_facet | Rasch, R. Jung, Helmut |
| author_role | aut aut |
| author_sort | Rasch, R. |
| author_variant | r r rr h j hj |
| building | Verbundindex |
| bvnumber | BV025338190 |
| ctrlnum | (OCoLC)917245078 (DE-599)BVBBV025338190 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01043nam a2200277 cb4500</leader><controlfield tag="001">BV025338190</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">100417s1991 d||| |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)917245078</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV025338190</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-11</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Rasch, R.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Computing shortest paths between circles</subfield><subfield code="c">R. Rasch ; H. Jung. [Humboldt-Universität Berlin, Informatik. Hrsg.: Dekan des Fachbereichs Informatik]</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin</subfield><subfield code="b">Dekan des Fachbereichs Informatik</subfield><subfield code="c">1991</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">23 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="490" ind1="1" ind2=" "><subfield code="a">Informatik-Preprint / Humboldt-Universität zu Berlin, Fachbereich Informatik</subfield><subfield code="v">11</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Jung, Helmut</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Universität <Berlin, Humboldt-Universität> </subfield><subfield code="p">Fachbereich Informatik</subfield><subfield code="t">Informatik-Preprint</subfield><subfield code="v">11</subfield><subfield code="w">(DE-604)BV024785625</subfield><subfield code="9">11</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-019966754</subfield></datafield></record></collection> |
| id | DE-604.BV025338190 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T22:31:25Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-019966754 |
| oclc_num | 917245078 |
| open_access_boolean | |
| owner | DE-11 |
| owner_facet | DE-11 |
| physical | 23 S. graph. Darst. |
| publishDate | 1991 |
| publishDateSearch | 1991 |
| publishDateSort | 1991 |
| publisher | Dekan des Fachbereichs Informatik |
| record_format | marc |
| series2 | Informatik-Preprint / Humboldt-Universität zu Berlin, Fachbereich Informatik |
| spelling | Rasch, R. Verfasser aut Computing shortest paths between circles R. Rasch ; H. Jung. [Humboldt-Universität Berlin, Informatik. Hrsg.: Dekan des Fachbereichs Informatik] Berlin Dekan des Fachbereichs Informatik 1991 23 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Informatik-Preprint / Humboldt-Universität zu Berlin, Fachbereich Informatik 11 Jung, Helmut Verfasser aut Universität <Berlin, Humboldt-Universität> Fachbereich Informatik Informatik-Preprint 11 (DE-604)BV024785625 11 |
| spellingShingle | Rasch, R. Jung, Helmut Computing shortest paths between circles |
| title | Computing shortest paths between circles |
| title_auth | Computing shortest paths between circles |
| title_exact_search | Computing shortest paths between circles |
| title_full | Computing shortest paths between circles R. Rasch ; H. Jung. [Humboldt-Universität Berlin, Informatik. Hrsg.: Dekan des Fachbereichs Informatik] |
| title_fullStr | Computing shortest paths between circles R. Rasch ; H. Jung. [Humboldt-Universität Berlin, Informatik. Hrsg.: Dekan des Fachbereichs Informatik] |
| title_full_unstemmed | Computing shortest paths between circles R. Rasch ; H. Jung. [Humboldt-Universität Berlin, Informatik. Hrsg.: Dekan des Fachbereichs Informatik] |
| title_short | Computing shortest paths between circles |
| title_sort | computing shortest paths between circles |
| volume_link | (DE-604)BV024785625 |
| work_keys_str_mv | AT raschr computingshortestpathsbetweencircles AT junghelmut computingshortestpathsbetweencircles |