The elusiveness of large cliques in a random graph:
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
Edinburgh
1990
|
Schriftenreihe: | University <Edinburgh> / Department of Computer Science: CSR
9 |
Schlagworte: | |
Beschreibung: | 13 S. |
Internformat
MARC
LEADER | 00000nam a2200000 cb4500 | ||
---|---|---|---|
001 | BV008974658 | ||
003 | DE-604 | ||
005 | 19940721 | ||
007 | t | ||
008 | 940206s1990 |||| 00||| eng d | ||
035 | |a (OCoLC)78264383 | ||
035 | |a (DE-599)BVBBV008974658 | ||
040 | |a DE-604 |b ger |e rakddb | ||
041 | 0 | |a eng | |
049 | |a DE-29T |a DE-91G | ||
082 | 0 | |a 510 |2 22 | |
100 | 1 | |a Jerrum, Mark |d 1955- |e Verfasser |0 (DE-588)12443133X |4 aut | |
245 | 1 | 0 | |a The elusiveness of large cliques in a random graph |c Mark Jerrum |
264 | 1 | |a Edinburgh |c 1990 | |
300 | |a 13 S. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
490 | 1 | |a University <Edinburgh> / Department of Computer Science: CSR |v 9 | |
650 | 4 | |a Pure mathematics | |
650 | 4 | |a [Computer graph theory] | |
650 | 4 | |a Mathematik | |
650 | 4 | |a Mathematics | |
810 | 2 | |a Department of Computer Science: CSR |t University <Edinburgh> |v 9 |w (DE-604)BV008906637 |9 9 | |
999 | |a oai:aleph.bib-bvb.de:BVB01-005926207 |
Datensatz im Suchindex
_version_ | 1804123312703406080 |
---|---|
any_adam_object | |
author | Jerrum, Mark 1955- |
author_GND | (DE-588)12443133X |
author_facet | Jerrum, Mark 1955- |
author_role | aut |
author_sort | Jerrum, Mark 1955- |
author_variant | m j mj |
building | Verbundindex |
bvnumber | BV008974658 |
ctrlnum | (OCoLC)78264383 (DE-599)BVBBV008974658 |
dewey-full | 510 |
dewey-hundreds | 500 - Natural sciences and mathematics |
dewey-ones | 510 - Mathematics |
dewey-raw | 510 |
dewey-search | 510 |
dewey-sort | 3510 |
dewey-tens | 510 - Mathematics |
discipline | Mathematik |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01011nam a2200325 cb4500</leader><controlfield tag="001">BV008974658</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19940721 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940206s1990 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)78264383</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV008974658</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">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-29T</subfield><subfield code="a">DE-91G</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">510</subfield><subfield code="2">22</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Jerrum, Mark</subfield><subfield code="d">1955-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)12443133X</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">The elusiveness of large cliques in a random graph</subfield><subfield code="c">Mark Jerrum</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Edinburgh</subfield><subfield code="c">1990</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">13 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">University <Edinburgh> / Department of Computer Science: CSR</subfield><subfield code="v">9</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Pure mathematics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">[Computer graph theory]</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematik</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematics</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Computer Science: CSR</subfield><subfield code="t">University <Edinburgh></subfield><subfield code="v">9</subfield><subfield code="w">(DE-604)BV008906637</subfield><subfield code="9">9</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005926207</subfield></datafield></record></collection> |
id | DE-604.BV008974658 |
illustrated | Not Illustrated |
indexdate | 2024-07-09T17:27:46Z |
institution | BVB |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005926207 |
oclc_num | 78264383 |
open_access_boolean | |
owner | DE-29T DE-91G DE-BY-TUM |
owner_facet | DE-29T DE-91G DE-BY-TUM |
physical | 13 S. |
publishDate | 1990 |
publishDateSearch | 1990 |
publishDateSort | 1990 |
record_format | marc |
series2 | University <Edinburgh> / Department of Computer Science: CSR |
spelling | Jerrum, Mark 1955- Verfasser (DE-588)12443133X aut The elusiveness of large cliques in a random graph Mark Jerrum Edinburgh 1990 13 S. txt rdacontent n rdamedia nc rdacarrier University <Edinburgh> / Department of Computer Science: CSR 9 Pure mathematics [Computer graph theory] Mathematik Mathematics Department of Computer Science: CSR University <Edinburgh> 9 (DE-604)BV008906637 9 |
spellingShingle | Jerrum, Mark 1955- The elusiveness of large cliques in a random graph Pure mathematics [Computer graph theory] Mathematik Mathematics |
title | The elusiveness of large cliques in a random graph |
title_auth | The elusiveness of large cliques in a random graph |
title_exact_search | The elusiveness of large cliques in a random graph |
title_full | The elusiveness of large cliques in a random graph Mark Jerrum |
title_fullStr | The elusiveness of large cliques in a random graph Mark Jerrum |
title_full_unstemmed | The elusiveness of large cliques in a random graph Mark Jerrum |
title_short | The elusiveness of large cliques in a random graph |
title_sort | the elusiveness of large cliques in a random graph |
topic | Pure mathematics [Computer graph theory] Mathematik Mathematics |
topic_facet | Pure mathematics [Computer graph theory] Mathematik Mathematics |
volume_link | (DE-604)BV008906637 |
work_keys_str_mv | AT jerrummark theelusivenessoflargecliquesinarandomgraph |