Shortest edge-disjoint paths in geodetically connected graphs:
Saved in:
| Main Author: | |
|---|---|
| Format: | Book |
| Language: | German |
| Published: |
Oldenburg
1988
|
| Series: | Berichte aus dem Fachbereich Informatik der Universität Oldenburg / Universität <Oldenburg> / Fachbereich Informatik
1988,2 : Forschungsbericht |
| Physical Description: | 21 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV002547189 | ||
| 003 | DE-604 | ||
| 005 | 19900410 | ||
| 007 | t| | ||
| 008 | 900409s1988 xx |||| 00||| gerod | ||
| 035 | |a (OCoLC)74900921 | ||
| 035 | |a (DE-599)BVBBV002547189 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a ger | |
| 049 | |a DE-12 |a DE-91G |a DE-739 |a DE-29T | ||
| 100 | 1 | |a Schwill, Andreas |d 1958- |e Verfasser |0 (DE-588)13258834X |4 aut | |
| 245 | 1 | 0 | |a Shortest edge-disjoint paths in geodetically connected graphs |
| 264 | 1 | |a Oldenburg |c 1988 | |
| 300 | |a 21 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Berichte aus dem Fachbereich Informatik der Universität Oldenburg / Universität <Oldenburg> / Fachbereich Informatik |v 1988,2 : Forschungsbericht | |
| 810 | 2 | |a Universität <Oldenburg> / Fachbereich Informatik |t Berichte aus dem Fachbereich Informatik der Universität Oldenburg |v 1988,2 : Forschungsbericht |w (DE-604)BV000900143 |9 1988,2 : Forsc | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-001639531 | |
Record in the Search Index
| DE-BY-TUM_call_number | 0102 DAT 001z 2001 A 993-1988,2 |
|---|---|
| DE-BY-TUM_katkey | 741439 |
| DE-BY-TUM_location | 01 |
| DE-BY-TUM_media_number | 040010250772 |
| _version_ | 1821931122799411200 |
| adam_text | |
| any_adam_object | |
| author | Schwill, Andreas 1958- |
| author_GND | (DE-588)13258834X |
| author_facet | Schwill, Andreas 1958- |
| author_role | aut |
| author_sort | Schwill, Andreas 1958- |
| author_variant | a s as |
| building | Verbundindex |
| bvnumber | BV002547189 |
| classification_rvk | SS 5560 |
| ctrlnum | (OCoLC)74900921 (DE-599)BVBBV002547189 |
| discipline | Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 cb4500</leader><controlfield tag="001">BV002547189</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19900410</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">900409s1988 xx |||| 00||| gerod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)74900921</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV002547189</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">ger</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-12</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-29T</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Schwill, Andreas</subfield><subfield code="d">1958-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)13258834X</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Shortest edge-disjoint paths in geodetically connected graphs</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Oldenburg</subfield><subfield code="c">1988</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">21 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="490" ind1="1" ind2=" "><subfield code="a">Berichte aus dem Fachbereich Informatik der Universität Oldenburg / Universität <Oldenburg> / Fachbereich Informatik</subfield><subfield code="v">1988,2 : Forschungsbericht</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Universität <Oldenburg> / Fachbereich Informatik</subfield><subfield code="t">Berichte aus dem Fachbereich Informatik der Universität Oldenburg</subfield><subfield code="v">1988,2 : Forschungsbericht</subfield><subfield code="w">(DE-604)BV000900143</subfield><subfield code="9">1988,2 : Forsc</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-001639531</subfield></datafield></record></collection> |
| id | DE-604.BV002547189 |
| illustrated | Not Illustrated |
| indexdate | 2025-01-11T18:56:10Z |
| institution | BVB |
| language | German |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-001639531 |
| oclc_num | 74900921 |
| open_access_boolean | |
| owner | DE-12 DE-91G DE-BY-TUM DE-739 DE-29T |
| owner_facet | DE-12 DE-91G DE-BY-TUM DE-739 DE-29T |
| physical | 21 S. |
| publishDate | 1988 |
| publishDateSearch | 1988 |
| publishDateSort | 1988 |
| record_format | marc |
| series2 | Berichte aus dem Fachbereich Informatik der Universität Oldenburg / Universität <Oldenburg> / Fachbereich Informatik |
| spellingShingle | Schwill, Andreas 1958- Shortest edge-disjoint paths in geodetically connected graphs |
| title | Shortest edge-disjoint paths in geodetically connected graphs |
| title_auth | Shortest edge-disjoint paths in geodetically connected graphs |
| title_exact_search | Shortest edge-disjoint paths in geodetically connected graphs |
| title_full | Shortest edge-disjoint paths in geodetically connected graphs |
| title_fullStr | Shortest edge-disjoint paths in geodetically connected graphs |
| title_full_unstemmed | Shortest edge-disjoint paths in geodetically connected graphs |
| title_short | Shortest edge-disjoint paths in geodetically connected graphs |
| title_sort | shortest edge disjoint paths in geodetically connected graphs |
| volume_link | (DE-604)BV000900143 |
| work_keys_str_mv | AT schwillandreas shortestedgedisjointpathsingeodeticallyconnectedgraphs |
Order paper/chapter scan
Branch Library Mathematics & Informatics
| Call Number: |
0102 DAT 001z 2001 A 993-1988,2
Floor plan |
|---|---|
| Copy 1 | Available for loan On Shelf |