A fixed matrix method for all shortest distances in a directed graph and for the inverse problem:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Abschlussarbeit Buch |
| Sprache: | German |
| Veröffentlicht: |
Bamberg
1970
|
| Schlagworte: | |
| Beschreibung: | Karlsruhe, Univ., Fak.f.Geistes-u.sozialwiss., Diss.v.1970 |
| Beschreibung: | 59 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV002961278 | ||
| 003 | DE-604 | ||
| 005 | 20020902 | ||
| 007 | t | ||
| 008 | 900725s1970 m||| 00||| ger d | ||
| 035 | |a (OCoLC)251613962 | ||
| 035 | |a (DE-599)BVBBV002961278 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a ger | |
| 049 | |a DE-384 |a DE-739 |a DE-355 |a DE-91 |a DE-19 |a DE-83 |a DE-188 | ||
| 100 | 1 | |a Murchland, John D. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a A fixed matrix method for all shortest distances in a directed graph and for the inverse problem |c John David Murchland |
| 264 | 1 | |a Bamberg |c 1970 | |
| 300 | |a 59 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 500 | |a Karlsruhe, Univ., Fak.f.Geistes-u.sozialwiss., Diss.v.1970 | ||
| 502 | |a Karlsruhe, Univ., Diss., 1970 | ||
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 940 | 1 | |q TUB-nvmb | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-001853925 | ||
Datensatz im Suchindex
| _version_ | 1804117252640866304 |
|---|---|
| any_adam_object | |
| author | Murchland, John D. |
| author_facet | Murchland, John D. |
| author_role | aut |
| author_sort | Murchland, John D. |
| author_variant | j d m jd jdm |
| building | Verbundindex |
| bvnumber | BV002961278 |
| ctrlnum | (OCoLC)251613962 (DE-599)BVBBV002961278 |
| format | Thesis Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00958nam a2200289 c 4500</leader><controlfield tag="001">BV002961278</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20020902 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">900725s1970 m||| 00||| ger d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)251613962</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV002961278</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-384</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-355</subfield><subfield code="a">DE-91</subfield><subfield code="a">DE-19</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-188</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Murchland, John D.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A fixed matrix method for all shortest distances in a directed graph and for the inverse problem</subfield><subfield code="c">John David Murchland</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Bamberg</subfield><subfield code="c">1970</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">59 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="500" ind1=" " ind2=" "><subfield code="a">Karlsruhe, Univ., Fak.f.Geistes-u.sozialwiss., Diss.v.1970</subfield></datafield><datafield tag="502" ind1=" " ind2=" "><subfield code="a">Karlsruhe, Univ., Diss., 1970</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="940" ind1="1" ind2=" "><subfield code="q">TUB-nvmb</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-001853925</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV002961278 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T15:51:27Z |
| institution | BVB |
| language | German |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-001853925 |
| oclc_num | 251613962 |
| open_access_boolean | |
| owner | DE-384 DE-739 DE-355 DE-BY-UBR DE-91 DE-BY-TUM DE-19 DE-BY-UBM DE-83 DE-188 |
| owner_facet | DE-384 DE-739 DE-355 DE-BY-UBR DE-91 DE-BY-TUM DE-19 DE-BY-UBM DE-83 DE-188 |
| physical | 59 S. |
| psigel | TUB-nvmb |
| publishDate | 1970 |
| publishDateSearch | 1970 |
| publishDateSort | 1970 |
| record_format | marc |
| spelling | Murchland, John D. Verfasser aut A fixed matrix method for all shortest distances in a directed graph and for the inverse problem John David Murchland Bamberg 1970 59 S. txt rdacontent n rdamedia nc rdacarrier Karlsruhe, Univ., Fak.f.Geistes-u.sozialwiss., Diss.v.1970 Karlsruhe, Univ., Diss., 1970 (DE-588)4113937-9 Hochschulschrift gnd-content |
| spellingShingle | Murchland, John D. A fixed matrix method for all shortest distances in a directed graph and for the inverse problem |
| subject_GND | (DE-588)4113937-9 |
| title | A fixed matrix method for all shortest distances in a directed graph and for the inverse problem |
| title_auth | A fixed matrix method for all shortest distances in a directed graph and for the inverse problem |
| title_exact_search | A fixed matrix method for all shortest distances in a directed graph and for the inverse problem |
| title_full | A fixed matrix method for all shortest distances in a directed graph and for the inverse problem John David Murchland |
| title_fullStr | A fixed matrix method for all shortest distances in a directed graph and for the inverse problem John David Murchland |
| title_full_unstemmed | A fixed matrix method for all shortest distances in a directed graph and for the inverse problem John David Murchland |
| title_short | A fixed matrix method for all shortest distances in a directed graph and for the inverse problem |
| title_sort | a fixed matrix method for all shortest distances in a directed graph and for the inverse problem |
| topic_facet | Hochschulschrift |
| work_keys_str_mv | AT murchlandjohnd afixedmatrixmethodforallshortestdistancesinadirectedgraphandfortheinverseproblem |