Heuristic coloring of weighted graphs and the maximum weight clique problem:
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Buch |
Sprache: | German |
Veröffentlicht: |
München
1991
|
Schriftenreihe: | Technische Universität <München>: TUM-MATH
9107 |
Beschreibung: | 21 S. |
Internformat
MARC
LEADER | 00000nam a2200000 cb4500 | ||
---|---|---|---|
001 | BV005768831 | ||
003 | DE-604 | ||
005 | 20200805 | ||
007 | t | ||
008 | 921106s1991 |||| 00||| gerod | ||
035 | |a (OCoLC)75344672 | ||
035 | |a (DE-599)BVBBV005768831 | ||
040 | |a DE-604 |b ger |e rakddb | ||
041 | 0 | |a ger | |
049 | |a DE-12 |a DE-91G | ||
088 | |a TUM M 9107 | ||
100 | 1 | |a Babel, Luitpold |d 1962- |e Verfasser |0 (DE-588)1215213646 |4 aut | |
245 | 1 | 0 | |a Heuristic coloring of weighted graphs and the maximum weight clique problem |c Luitpold Babel |
246 | 1 | 3 | |a TUM M 9107 |
264 | 1 | |a München |c 1991 | |
300 | |a 21 S. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
490 | 1 | |a Technische Universität <München>: TUM-MATH |v 9107 | |
830 | 0 | |a Technische Universität <München>: TUM-MATH |v 9107 |w (DE-604)BV006186461 |9 9107 | |
999 | |a oai:aleph.bib-bvb.de:BVB01-003603779 |
Datensatz im Suchindex
_version_ | 1804119952499671040 |
---|---|
any_adam_object | |
author | Babel, Luitpold 1962- |
author_GND | (DE-588)1215213646 |
author_facet | Babel, Luitpold 1962- |
author_role | aut |
author_sort | Babel, Luitpold 1962- |
author_variant | l b lb |
building | Verbundindex |
bvnumber | BV005768831 |
ctrlnum | (OCoLC)75344672 (DE-599)BVBBV005768831 |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00917nam a2200289 cb4500</leader><controlfield tag="001">BV005768831</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20200805 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">921106s1991 |||| 00||| gerod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)75344672</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV005768831</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></datafield><datafield tag="088" ind1=" " ind2=" "><subfield code="a">TUM M 9107</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Babel, Luitpold</subfield><subfield code="d">1962-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1215213646</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Heuristic coloring of weighted graphs and the maximum weight clique problem</subfield><subfield code="c">Luitpold Babel</subfield></datafield><datafield tag="246" ind1="1" ind2="3"><subfield code="a">TUM M 9107</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">München</subfield><subfield code="c">1991</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">Technische Universität <München>: TUM-MATH</subfield><subfield code="v">9107</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Technische Universität <München>: TUM-MATH</subfield><subfield code="v">9107</subfield><subfield code="w">(DE-604)BV006186461</subfield><subfield code="9">9107</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-003603779</subfield></datafield></record></collection> |
id | DE-604.BV005768831 |
illustrated | Not Illustrated |
indexdate | 2024-07-09T16:34:22Z |
institution | BVB |
language | German |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-003603779 |
oclc_num | 75344672 |
open_access_boolean | |
owner | DE-12 DE-91G DE-BY-TUM |
owner_facet | DE-12 DE-91G DE-BY-TUM |
physical | 21 S. |
publishDate | 1991 |
publishDateSearch | 1991 |
publishDateSort | 1991 |
record_format | marc |
series | Technische Universität <München>: TUM-MATH |
series2 | Technische Universität <München>: TUM-MATH |
spelling | Babel, Luitpold 1962- Verfasser (DE-588)1215213646 aut Heuristic coloring of weighted graphs and the maximum weight clique problem Luitpold Babel TUM M 9107 München 1991 21 S. txt rdacontent n rdamedia nc rdacarrier Technische Universität <München>: TUM-MATH 9107 Technische Universität <München>: TUM-MATH 9107 (DE-604)BV006186461 9107 |
spellingShingle | Babel, Luitpold 1962- Heuristic coloring of weighted graphs and the maximum weight clique problem Technische Universität <München>: TUM-MATH |
title | Heuristic coloring of weighted graphs and the maximum weight clique problem |
title_alt | TUM M 9107 |
title_auth | Heuristic coloring of weighted graphs and the maximum weight clique problem |
title_exact_search | Heuristic coloring of weighted graphs and the maximum weight clique problem |
title_full | Heuristic coloring of weighted graphs and the maximum weight clique problem Luitpold Babel |
title_fullStr | Heuristic coloring of weighted graphs and the maximum weight clique problem Luitpold Babel |
title_full_unstemmed | Heuristic coloring of weighted graphs and the maximum weight clique problem Luitpold Babel |
title_short | Heuristic coloring of weighted graphs and the maximum weight clique problem |
title_sort | heuristic coloring of weighted graphs and the maximum weight clique problem |
volume_link | (DE-604)BV006186461 |
work_keys_str_mv | AT babelluitpold heuristiccoloringofweightedgraphsandthemaximumweightcliqueproblem AT babelluitpold tumm9107 |