The complexity of maximum subgraph problems:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Abschlussarbeit Mikrofilm Buch |
| Sprache: | English |
| Veröffentlicht: |
1979
|
| Ausgabe: | [Mikrofiche-Ausg.] |
| Schlagworte: | |
| Beschreibung: | Includes bibliographical references (leaves 118-120) |
| Beschreibung: | II, 120 leaves graph. Darst. |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV023425672 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | he|uuuuuuuucu | ||
| 008 | 080731s1979 d||| bm||| 00||| eng d | ||
| 035 | |a (OCoLC)4523610 | ||
| 035 | |a (DE-599)BVBBV023425672 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-706 | ||
| 100 | 1 | |a Yannakakis, Michael |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a The complexity of maximum subgraph problems |c Michael Yannakakis |
| 250 | |a [Mikrofiche-Ausg.] | ||
| 264 | 1 | |c 1979 | |
| 300 | |a II, 120 leaves |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b h |2 rdamedia | ||
| 338 | |b he |2 rdacarrier | ||
| 500 | |a Includes bibliographical references (leaves 118-120) | ||
| 502 | |a Princeton, Calif., Univ., Diss., 1979 | ||
| 533 | |a Mikroform-Ausgabe |b Ann Arbor, Mich. |c Univ. Microfilms Internat. |d 1979 |e 2 Mikrofiches | ||
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 776 | 0 | 8 | |i Reproduktion von |a Yannakakis, Michael |t The complexity of maximum subgraph problems |d 1979 |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-016608034 | ||
Datensatz im Suchindex
| _version_ | 1804137820463300608 |
|---|---|
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author | Yannakakis, Michael |
| author_facet | Yannakakis, Michael |
| author_role | aut |
| author_sort | Yannakakis, Michael |
| author_variant | m y my |
| building | Verbundindex |
| bvnumber | BV023425672 |
| ctrlnum | (OCoLC)4523610 (DE-599)BVBBV023425672 |
| edition | [Mikrofiche-Ausg.] |
| format | Thesis Microfilm Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01105nam a2200313 c 4500</leader><controlfield tag="001">BV023425672</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">he|uuuuuuuucu</controlfield><controlfield tag="008">080731s1979 d||| bm||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)4523610</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV023425672</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-706</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Yannakakis, Michael</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">The complexity of maximum subgraph problems</subfield><subfield code="c">Michael Yannakakis</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">[Mikrofiche-Ausg.]</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">1979</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">II, 120 leaves</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">h</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">he</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references (leaves 118-120)</subfield></datafield><datafield tag="502" ind1=" " ind2=" "><subfield code="a">Princeton, Calif., Univ., Diss., 1979</subfield></datafield><datafield tag="533" ind1=" " ind2=" "><subfield code="a">Mikroform-Ausgabe</subfield><subfield code="b">Ann Arbor, Mich.</subfield><subfield code="c">Univ. Microfilms Internat.</subfield><subfield code="d">1979</subfield><subfield code="e">2 Mikrofiches</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="776" ind1="0" ind2="8"><subfield code="i">Reproduktion von</subfield><subfield code="a">Yannakakis, Michael</subfield><subfield code="t">The complexity of maximum subgraph problems</subfield><subfield code="d">1979</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-016608034</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV023425672 |
| illustrated | Illustrated |
| index_date | 2024-07-02T21:32:44Z |
| indexdate | 2024-07-09T21:18:22Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-016608034 |
| oclc_num | 4523610 |
| open_access_boolean | |
| owner | DE-706 |
| owner_facet | DE-706 |
| physical | II, 120 leaves graph. Darst. |
| publishDate | 1979 |
| publishDateSearch | 1979 |
| publishDateSort | 1979 |
| record_format | marc |
| spelling | Yannakakis, Michael Verfasser aut The complexity of maximum subgraph problems Michael Yannakakis [Mikrofiche-Ausg.] 1979 II, 120 leaves graph. Darst. txt rdacontent h rdamedia he rdacarrier Includes bibliographical references (leaves 118-120) Princeton, Calif., Univ., Diss., 1979 Mikroform-Ausgabe Ann Arbor, Mich. Univ. Microfilms Internat. 1979 2 Mikrofiches (DE-588)4113937-9 Hochschulschrift gnd-content Reproduktion von Yannakakis, Michael The complexity of maximum subgraph problems 1979 |
| spellingShingle | Yannakakis, Michael The complexity of maximum subgraph problems |
| subject_GND | (DE-588)4113937-9 |
| title | The complexity of maximum subgraph problems |
| title_auth | The complexity of maximum subgraph problems |
| title_exact_search | The complexity of maximum subgraph problems |
| title_exact_search_txtP | The complexity of maximum subgraph problems |
| title_full | The complexity of maximum subgraph problems Michael Yannakakis |
| title_fullStr | The complexity of maximum subgraph problems Michael Yannakakis |
| title_full_unstemmed | The complexity of maximum subgraph problems Michael Yannakakis |
| title_short | The complexity of maximum subgraph problems |
| title_sort | the complexity of maximum subgraph problems |
| topic_facet | Hochschulschrift |
| work_keys_str_mv | AT yannakakismichael thecomplexityofmaximumsubgraphproblems |