Finding maximum cliques in arbitrary and in special graphs:
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
München
Bibliothek der Fak. für Mathematik und Informatik, TUM
1990
|
Schriftenreihe: | Technische Universität <München>: TUM-MATH
9008 |
Beschreibung: | 28 S. graph. Darst. |
Internformat
MARC
LEADER | 00000nam a2200000 cb4500 | ||
---|---|---|---|
001 | BV004334738 | ||
003 | DE-604 | ||
005 | 20040406 | ||
007 | t | ||
008 | 910318s1990 gw d||| t||| 00||| eng d | ||
035 | |a (OCoLC)311556677 | ||
035 | |a (DE-599)BVBBV004334738 | ||
040 | |a DE-604 |b ger |e rakwb | ||
041 | 0 | |a eng | |
044 | |a gw |c DE | ||
049 | |a DE-12 |a DE-91G | ||
088 | |a TUM M 9008 | ||
100 | 1 | |a Babel, Luitpold |e Verfasser |4 aut | |
245 | 1 | 0 | |a Finding maximum cliques in arbitrary and in special graphs |c Luitpold Babel |
264 | 1 | |a München |b Bibliothek der Fak. für Mathematik und Informatik, TUM |c 1990 | |
300 | |a 28 S. |b graph. Darst. | ||
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 9008 | |
830 | 0 | |a Technische Universität <München>: TUM-MATH |v 9008 |w (DE-604)BV006186461 |9 9008 | |
999 | |a oai:aleph.bib-bvb.de:BVB01-002693933 |
Datensatz im Suchindex
_version_ | 1804118520496128000 |
---|---|
any_adam_object | |
author | Babel, Luitpold |
author_facet | Babel, Luitpold |
author_role | aut |
author_sort | Babel, Luitpold |
author_variant | l b lb |
building | Verbundindex |
bvnumber | BV004334738 |
ctrlnum | (OCoLC)311556677 (DE-599)BVBBV004334738 |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00941nam a2200289 cb4500</leader><controlfield tag="001">BV004334738</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20040406 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">910318s1990 gw d||| t||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)311556677</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV004334738</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="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">DE</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 9008</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Babel, Luitpold</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Finding maximum cliques in arbitrary and in special graphs</subfield><subfield code="c">Luitpold Babel</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">München</subfield><subfield code="b">Bibliothek der Fak. für Mathematik und Informatik, TUM</subfield><subfield code="c">1990</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">28 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">Technische Universität <München>: TUM-MATH</subfield><subfield code="v">9008</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Technische Universität <München>: TUM-MATH</subfield><subfield code="v">9008</subfield><subfield code="w">(DE-604)BV006186461</subfield><subfield code="9">9008</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-002693933</subfield></datafield></record></collection> |
id | DE-604.BV004334738 |
illustrated | Illustrated |
indexdate | 2024-07-09T16:11:36Z |
institution | BVB |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-002693933 |
oclc_num | 311556677 |
open_access_boolean | |
owner | DE-12 DE-91G DE-BY-TUM |
owner_facet | DE-12 DE-91G DE-BY-TUM |
physical | 28 S. graph. Darst. |
publishDate | 1990 |
publishDateSearch | 1990 |
publishDateSort | 1990 |
publisher | Bibliothek der Fak. für Mathematik und Informatik, TUM |
record_format | marc |
series | Technische Universität <München>: TUM-MATH |
series2 | Technische Universität <München>: TUM-MATH |
spelling | Babel, Luitpold Verfasser aut Finding maximum cliques in arbitrary and in special graphs Luitpold Babel München Bibliothek der Fak. für Mathematik und Informatik, TUM 1990 28 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Technische Universität <München>: TUM-MATH 9008 Technische Universität <München>: TUM-MATH 9008 (DE-604)BV006186461 9008 |
spellingShingle | Babel, Luitpold Finding maximum cliques in arbitrary and in special graphs Technische Universität <München>: TUM-MATH |
title | Finding maximum cliques in arbitrary and in special graphs |
title_auth | Finding maximum cliques in arbitrary and in special graphs |
title_exact_search | Finding maximum cliques in arbitrary and in special graphs |
title_full | Finding maximum cliques in arbitrary and in special graphs Luitpold Babel |
title_fullStr | Finding maximum cliques in arbitrary and in special graphs Luitpold Babel |
title_full_unstemmed | Finding maximum cliques in arbitrary and in special graphs Luitpold Babel |
title_short | Finding maximum cliques in arbitrary and in special graphs |
title_sort | finding maximum cliques in arbitrary and in special graphs |
volume_link | (DE-604)BV006186461 |
work_keys_str_mv | AT babelluitpold findingmaximumcliquesinarbitraryandinspecialgraphs |