On the complexity of the maximum cut problem:
Gespeichert in:
| Beteiligte Personen: | , |
|---|---|
| Format: | Buch |
| Sprache: | Nichtbestimmte Sprache |
| Veröffentlicht: |
Trier
Fb IV, Mathematik und Informatik, Univ.
1991
|
| Schriftenreihe: | Deutsche Forschungsgemeinschaft / Schwerpunktprogramm Anwendungsbezogene Optimierung und Steuerung: Report
339 |
| Umfang: | 19 S. graph. Darst. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV007071151 | ||
| 003 | DE-604 | ||
| 005 | 19940120 | ||
| 007 | t| | ||
| 008 | 930427s1991 xx d||| |||| 00||| und d | ||
| 035 | |a (OCoLC)165484787 | ||
| 035 | |a (DE-599)BVBBV007071151 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | |a und | ||
| 049 | |a DE-384 |a DE-12 |a DE-91 | ||
| 084 | |a SI 990 |0 (DE-625)143213: |2 rvk | ||
| 100 | 1 | |a Bodlaender, Hans L. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a On the complexity of the maximum cut problem |c by Hans L. Bodlaender and Klaus Jansen |
| 264 | 1 | |a Trier |b Fb IV, Mathematik und Informatik, Univ. |c 1991 | |
| 300 | |a 19 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Deutsche Forschungsgemeinschaft / Schwerpunktprogramm Anwendungsbezogene Optimierung und Steuerung: Report |v 339 | |
| 700 | 1 | |a Jansen, Klaus |e Verfasser |4 aut | |
| 810 | 2 | |a Schwerpunktprogramm Anwendungsbezogene Optimierung und Steuerung: Report |t Deutsche Forschungsgemeinschaft |v 339 |w (DE-604)BV004264501 |9 339 | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-004493849 | |
Datensatz im Suchindex
| DE-BY-TUM_call_number | 0001 94 B 459-339 |
|---|---|
| DE-BY-TUM_katkey | 586650 |
| DE-BY-TUM_location | Mag |
| DE-BY-TUM_media_number | 040002542609 |
| _version_ | 1821938566936133633 |
| any_adam_object | |
| author | Bodlaender, Hans L. Jansen, Klaus |
| author_facet | Bodlaender, Hans L. Jansen, Klaus |
| author_role | aut aut |
| author_sort | Bodlaender, Hans L. |
| author_variant | h l b hl hlb k j kj |
| building | Verbundindex |
| bvnumber | BV007071151 |
| classification_rvk | SI 990 |
| ctrlnum | (OCoLC)165484787 (DE-599)BVBBV007071151 |
| discipline | Mathematik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01106nam a2200289 cb4500</leader><controlfield tag="001">BV007071151</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19940120 </controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">930427s1991 xx d||| |||| 00||| und d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)165484787</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV007071151</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=" " ind2=" "><subfield code="a">und</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-384</subfield><subfield code="a">DE-12</subfield><subfield code="a">DE-91</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SI 990</subfield><subfield code="0">(DE-625)143213:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Bodlaender, Hans L.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">On the complexity of the maximum cut problem</subfield><subfield code="c">by Hans L. Bodlaender and Klaus Jansen</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Trier</subfield><subfield code="b">Fb IV, Mathematik und Informatik, Univ.</subfield><subfield code="c">1991</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">19 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">Deutsche Forschungsgemeinschaft / Schwerpunktprogramm Anwendungsbezogene Optimierung und Steuerung: Report</subfield><subfield code="v">339</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Jansen, Klaus</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Schwerpunktprogramm Anwendungsbezogene Optimierung und Steuerung: Report</subfield><subfield code="t">Deutsche Forschungsgemeinschaft</subfield><subfield code="v">339</subfield><subfield code="w">(DE-604)BV004264501</subfield><subfield code="9">339</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-004493849</subfield></datafield></record></collection> |
| id | DE-604.BV007071151 |
| illustrated | Illustrated |
| indexdate | 2024-12-20T08:57:28Z |
| institution | BVB |
| language | Undetermined |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-004493849 |
| oclc_num | 165484787 |
| open_access_boolean | |
| owner | DE-384 DE-12 DE-91 DE-BY-TUM |
| owner_facet | DE-384 DE-12 DE-91 DE-BY-TUM |
| physical | 19 S. graph. Darst. |
| publishDate | 1991 |
| publishDateSearch | 1991 |
| publishDateSort | 1991 |
| publisher | Fb IV, Mathematik und Informatik, Univ. |
| record_format | marc |
| series2 | Deutsche Forschungsgemeinschaft / Schwerpunktprogramm Anwendungsbezogene Optimierung und Steuerung: Report |
| spellingShingle | Bodlaender, Hans L. Jansen, Klaus On the complexity of the maximum cut problem |
| title | On the complexity of the maximum cut problem |
| title_auth | On the complexity of the maximum cut problem |
| title_exact_search | On the complexity of the maximum cut problem |
| title_full | On the complexity of the maximum cut problem by Hans L. Bodlaender and Klaus Jansen |
| title_fullStr | On the complexity of the maximum cut problem by Hans L. Bodlaender and Klaus Jansen |
| title_full_unstemmed | On the complexity of the maximum cut problem by Hans L. Bodlaender and Klaus Jansen |
| title_short | On the complexity of the maximum cut problem |
| title_sort | on the complexity of the maximum cut problem |
| volume_link | (DE-604)BV004264501 |
| work_keys_str_mv | AT bodlaenderhansl onthecomplexityofthemaximumcutproblem AT jansenklaus onthecomplexityofthemaximumcutproblem |
Paper/Kapitel scannen lassen
Bibliotheksmagazin
| Signatur: |
0001 94 B 459-339 Lageplan |
|---|---|
| Exemplar 1 | Ausleihbar Am Standort |