Deriving general schemes for classes of graph algorithms:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Abschlussarbeit Buch |
| Sprache: | German |
| Veröffentlicht: |
Augsburg
Wissner
1996
|
| Schriftenreihe: | Augsburger mathematisch-naturwissenschaftliche Schriften
13 |
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | Zugl.: Augsburg, Univ., Diss., 1996. - Zsfassung in dt. Sprache |
| Beschreibung: | 95 S. |
| ISBN: | 3896390449 |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010990515 | ||
| 003 | DE-604 | ||
| 005 | 19961218 | ||
| 007 | t | ||
| 008 | 960930s1996 gw m||| 00||| ger d | ||
| 016 | 7 | |a 948654821 |2 DE-101 | |
| 020 | |a 3896390449 |9 3-89639-044-9 | ||
| 035 | |a (OCoLC)231685279 | ||
| 035 | |a (DE-599)BVBBV010990515 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a ger | |
| 044 | |a gw |c DE | ||
| 049 | |a DE-384 |a DE-12 |a DE-37 |a DE-739 |a DE-188 | ||
| 084 | |a ST 130 |0 (DE-625)143588: |2 rvk | ||
| 084 | |a ST 132 |0 (DE-625)143589: |2 rvk | ||
| 100 | 1 | |a Russling, Martin |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Deriving general schemes for classes of graph algorithms |c Martin Russling |
| 264 | 1 | |a Augsburg |b Wissner |c 1996 | |
| 300 | |a 95 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Augsburger mathematisch-naturwissenschaftliche Schriften |v 13 | |
| 500 | |a Zugl.: Augsburg, Univ., Diss., 1996. - Zsfassung in dt. Sprache | ||
| 502 | |a Zugl.: Augsburg, Univ., Diss., 1996 | ||
| 650 | 0 | 7 | |a Graphentheorie |0 (DE-588)4113782-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Automatisches Beweisverfahren |0 (DE-588)4069034-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Graph |0 (DE-588)4021842-9 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 689 | 0 | 0 | |a Graph |0 (DE-588)4021842-9 |D s |
| 689 | 0 | 1 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 0 | 2 | |a Automatisches Beweisverfahren |0 (DE-588)4069034-9 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 1 | 1 | |a Graphentheorie |0 (DE-588)4113782-6 |D s |
| 689 | 1 | |5 DE-188 | |
| 830 | 0 | |a Augsburger mathematisch-naturwissenschaftliche Schriften |v 13 |w (DE-604)BV009824413 |9 13 | |
| 856 | 4 | 2 | |m DNB Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=007356372&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007356372 | ||
Datensatz im Suchindex
| _version_ | 1804125480356413440 |
|---|---|
| any_adam_object | 1 |
| author | Russling, Martin |
| author_facet | Russling, Martin |
| author_role | aut |
| author_sort | Russling, Martin |
| author_variant | m r mr |
| building | Verbundindex |
| bvnumber | BV010990515 |
| classification_rvk | ST 130 ST 132 |
| ctrlnum | (OCoLC)231685279 (DE-599)BVBBV010990515 |
| discipline | Informatik |
| format | Thesis Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02075nam a2200505 cb4500</leader><controlfield tag="001">BV010990515</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19961218 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">960930s1996 gw m||| 00||| ger d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">948654821</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3896390449</subfield><subfield code="9">3-89639-044-9</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)231685279</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010990515</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="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">DE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-384</subfield><subfield code="a">DE-12</subfield><subfield code="a">DE-37</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-188</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 130</subfield><subfield code="0">(DE-625)143588:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 132</subfield><subfield code="0">(DE-625)143589:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Russling, Martin</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Deriving general schemes for classes of graph algorithms</subfield><subfield code="c">Martin Russling</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Augsburg</subfield><subfield code="b">Wissner</subfield><subfield code="c">1996</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">95 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">Augsburger mathematisch-naturwissenschaftliche Schriften</subfield><subfield code="v">13</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Zugl.: Augsburg, Univ., Diss., 1996. - Zsfassung in dt. Sprache</subfield></datafield><datafield tag="502" ind1=" " ind2=" "><subfield code="a">Zugl.: Augsburg, Univ., Diss., 1996</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Graphentheorie</subfield><subfield code="0">(DE-588)4113782-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Automatisches Beweisverfahren</subfield><subfield code="0">(DE-588)4069034-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="650" ind1="0" ind2="7"><subfield code="a">Graph</subfield><subfield code="0">(DE-588)4021842-9</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">Graph</subfield><subfield code="0">(DE-588)4021842-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><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="2"><subfield code="a">Automatisches Beweisverfahren</subfield><subfield code="0">(DE-588)4069034-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">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Graphentheorie</subfield><subfield code="0">(DE-588)4113782-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-188</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Augsburger mathematisch-naturwissenschaftliche Schriften</subfield><subfield code="v">13</subfield><subfield code="w">(DE-604)BV009824413</subfield><subfield code="9">13</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">DNB Datenaustausch</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=007356372&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007356372</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV010990515 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T18:02:14Z |
| institution | BVB |
| isbn | 3896390449 |
| language | German |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007356372 |
| oclc_num | 231685279 |
| open_access_boolean | |
| owner | DE-384 DE-12 DE-37 DE-739 DE-188 |
| owner_facet | DE-384 DE-12 DE-37 DE-739 DE-188 |
| physical | 95 S. |
| publishDate | 1996 |
| publishDateSearch | 1996 |
| publishDateSort | 1996 |
| publisher | Wissner |
| record_format | marc |
| series | Augsburger mathematisch-naturwissenschaftliche Schriften |
| series2 | Augsburger mathematisch-naturwissenschaftliche Schriften |
| spelling | Russling, Martin Verfasser aut Deriving general schemes for classes of graph algorithms Martin Russling Augsburg Wissner 1996 95 S. txt rdacontent n rdamedia nc rdacarrier Augsburger mathematisch-naturwissenschaftliche Schriften 13 Zugl.: Augsburg, Univ., Diss., 1996. - Zsfassung in dt. Sprache Zugl.: Augsburg, Univ., Diss., 1996 Graphentheorie (DE-588)4113782-6 gnd rswk-swf Automatisches Beweisverfahren (DE-588)4069034-9 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf Graph (DE-588)4021842-9 gnd rswk-swf (DE-588)4113937-9 Hochschulschrift gnd-content Graph (DE-588)4021842-9 s Algorithmus (DE-588)4001183-5 s Automatisches Beweisverfahren (DE-588)4069034-9 s DE-604 Graphentheorie (DE-588)4113782-6 s DE-188 Augsburger mathematisch-naturwissenschaftliche Schriften 13 (DE-604)BV009824413 13 DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=007356372&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Russling, Martin Deriving general schemes for classes of graph algorithms Augsburger mathematisch-naturwissenschaftliche Schriften Graphentheorie (DE-588)4113782-6 gnd Automatisches Beweisverfahren (DE-588)4069034-9 gnd Algorithmus (DE-588)4001183-5 gnd Graph (DE-588)4021842-9 gnd |
| subject_GND | (DE-588)4113782-6 (DE-588)4069034-9 (DE-588)4001183-5 (DE-588)4021842-9 (DE-588)4113937-9 |
| title | Deriving general schemes for classes of graph algorithms |
| title_auth | Deriving general schemes for classes of graph algorithms |
| title_exact_search | Deriving general schemes for classes of graph algorithms |
| title_full | Deriving general schemes for classes of graph algorithms Martin Russling |
| title_fullStr | Deriving general schemes for classes of graph algorithms Martin Russling |
| title_full_unstemmed | Deriving general schemes for classes of graph algorithms Martin Russling |
| title_short | Deriving general schemes for classes of graph algorithms |
| title_sort | deriving general schemes for classes of graph algorithms |
| topic | Graphentheorie (DE-588)4113782-6 gnd Automatisches Beweisverfahren (DE-588)4069034-9 gnd Algorithmus (DE-588)4001183-5 gnd Graph (DE-588)4021842-9 gnd |
| topic_facet | Graphentheorie Automatisches Beweisverfahren Algorithmus Graph Hochschulschrift |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=007356372&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| volume_link | (DE-604)BV009824413 |
| work_keys_str_mv | AT russlingmartin derivinggeneralschemesforclassesofgraphalgorithms |