Worst and best case behaviour of an approximate graph coloring algorithm:
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Buch |
| Sprache: | German |
| Veröffentlicht: |
Karlsruhe
1981
|
| Schriftenreihe: | Universität <Karlsruhe> / Fakultät für Informatik: Interner Bericht
81,14 |
| Beschreibung: | 9 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009075761 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940227s1981 |||| 00||| ger d | ||
| 035 | |a (OCoLC)46064724 | ||
| 035 | |a (DE-599)BVBBV009075761 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a ger | |
| 049 | |a DE-29T |a DE-91G | ||
| 100 | 1 | |a Dürre, Karl |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Worst and best case behaviour of an approximate graph coloring algorithm |c Karl Dürre ; Johannes Heuft ; Heinrich Müller* |
| 264 | 1 | |a Karlsruhe |c 1981 | |
| 300 | |a 9 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Universität <Karlsruhe> / Fakultät für Informatik: Interner Bericht |v 81,14 | |
| 700 | 1 | |a Heuft, Johannes |d 1956- |e Verfasser |0 (DE-588)109928970 |4 aut | |
| 700 | 1 | |a Müller, Heinrich |e Verfasser |4 aut | |
| 810 | 2 | |a Fakultät für Informatik: Interner Bericht |t Universität <Karlsruhe> |v 81,14 |w (DE-604)BV000003275 |9 81,14 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006013095 | ||
Datensatz im Suchindex
| _version_ | 1804123489616003072 |
|---|---|
| any_adam_object | |
| author | Dürre, Karl Heuft, Johannes 1956- Müller, Heinrich |
| author_GND | (DE-588)109928970 |
| author_facet | Dürre, Karl Heuft, Johannes 1956- Müller, Heinrich |
| author_role | aut aut aut |
| author_sort | Dürre, Karl |
| author_variant | k d kd j h jh h m hm |
| building | Verbundindex |
| bvnumber | BV009075761 |
| ctrlnum | (OCoLC)46064724 (DE-599)BVBBV009075761 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01043nam a2200289 cb4500</leader><controlfield tag="001">BV009075761</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940227s1981 |||| 00||| ger d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)46064724</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009075761</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-29T</subfield><subfield code="a">DE-91G</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Dürre, Karl</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Worst and best case behaviour of an approximate graph coloring algorithm</subfield><subfield code="c">Karl Dürre ; Johannes Heuft ; Heinrich Müller*</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Karlsruhe</subfield><subfield code="c">1981</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">9 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">Universität <Karlsruhe> / Fakultät für Informatik: Interner Bericht</subfield><subfield code="v">81,14</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Heuft, Johannes</subfield><subfield code="d">1956-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)109928970</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Müller, Heinrich</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Fakultät für Informatik: Interner Bericht</subfield><subfield code="t">Universität <Karlsruhe></subfield><subfield code="v">81,14</subfield><subfield code="w">(DE-604)BV000003275</subfield><subfield code="9">81,14</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006013095</subfield></datafield></record></collection> |
| id | DE-604.BV009075761 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:30:35Z |
| institution | BVB |
| language | German |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006013095 |
| oclc_num | 46064724 |
| open_access_boolean | |
| owner | DE-29T DE-91G DE-BY-TUM |
| owner_facet | DE-29T DE-91G DE-BY-TUM |
| physical | 9 S. |
| publishDate | 1981 |
| publishDateSearch | 1981 |
| publishDateSort | 1981 |
| record_format | marc |
| series2 | Universität <Karlsruhe> / Fakultät für Informatik: Interner Bericht |
| spelling | Dürre, Karl Verfasser aut Worst and best case behaviour of an approximate graph coloring algorithm Karl Dürre ; Johannes Heuft ; Heinrich Müller* Karlsruhe 1981 9 S. txt rdacontent n rdamedia nc rdacarrier Universität <Karlsruhe> / Fakultät für Informatik: Interner Bericht 81,14 Heuft, Johannes 1956- Verfasser (DE-588)109928970 aut Müller, Heinrich Verfasser aut Fakultät für Informatik: Interner Bericht Universität <Karlsruhe> 81,14 (DE-604)BV000003275 81,14 |
| spellingShingle | Dürre, Karl Heuft, Johannes 1956- Müller, Heinrich Worst and best case behaviour of an approximate graph coloring algorithm |
| title | Worst and best case behaviour of an approximate graph coloring algorithm |
| title_auth | Worst and best case behaviour of an approximate graph coloring algorithm |
| title_exact_search | Worst and best case behaviour of an approximate graph coloring algorithm |
| title_full | Worst and best case behaviour of an approximate graph coloring algorithm Karl Dürre ; Johannes Heuft ; Heinrich Müller* |
| title_fullStr | Worst and best case behaviour of an approximate graph coloring algorithm Karl Dürre ; Johannes Heuft ; Heinrich Müller* |
| title_full_unstemmed | Worst and best case behaviour of an approximate graph coloring algorithm Karl Dürre ; Johannes Heuft ; Heinrich Müller* |
| title_short | Worst and best case behaviour of an approximate graph coloring algorithm |
| title_sort | worst and best case behaviour of an approximate graph coloring algorithm |
| volume_link | (DE-604)BV000003275 |
| work_keys_str_mv | AT durrekarl worstandbestcasebehaviourofanapproximategraphcoloringalgorithm AT heuftjohannes worstandbestcasebehaviourofanapproximategraphcoloringalgorithm AT mullerheinrich worstandbestcasebehaviourofanapproximategraphcoloringalgorithm |