Effiziente Algorithmen für perfekte Graphen:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | German |
| Veröffentlicht: |
Stuttgart
Teubner
1992
|
| Schriftenreihe: | Leitfäden und Monographien der Informatik
|
| Schlagworte: | |
| Beschreibung: | Literaturverz. S. [273] - 281 |
| Beschreibung: | VIII, 286 S. graph. Darst. |
| ISBN: | 3519029405 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV004793964 | ||
| 003 | DE-604 | ||
| 005 | 20210202 | ||
| 007 | t | ||
| 008 | 920224s1992 d||| |||| 00||| ger d | ||
| 020 | |a 3519029405 |9 3-519-02940-5 | ||
| 020 | |z 3519029409 |9 3-519-02940-9 | ||
| 035 | |a (OCoLC)75246506 | ||
| 035 | |a (DE-599)BVBBV004793964 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a ger | |
| 049 | |a DE-473 |a DE-739 |a DE-91G |a DE-M347 |a DE-20 |a DE-29T |a DE-355 |a DE-706 |a DE-634 |a DE-83 |a DE-11 |a DE-188 | ||
| 084 | |a SK 890 |0 (DE-625)143267: |2 rvk | ||
| 084 | |a ST 130 |0 (DE-625)143588: |2 rvk | ||
| 084 | |a ST 134 |0 (DE-625)143590: |2 rvk | ||
| 084 | |a DAT 537f |2 stub | ||
| 084 | |a 05C85 |2 msc | ||
| 084 | |a 05C60 |2 msc | ||
| 084 | |a 68R10 |2 msc | ||
| 100 | 1 | |a Simon, Klaus |d 1958- |e Verfasser |0 (DE-588)140611193 |4 aut | |
| 245 | 1 | 0 | |a Effiziente Algorithmen für perfekte Graphen |c von Klaus Simon |
| 264 | 1 | |a Stuttgart |b Teubner |c 1992 | |
| 300 | |a VIII, 286 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 0 | |a Leitfäden und Monographien der Informatik | |
| 500 | |a Literaturverz. S. [273] - 281 | ||
| 650 | 0 | 7 | |a Graphentheorie |0 (DE-588)4113782-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Perfekter Graph |0 (DE-588)4173735-0 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Effizienter Algorithmus |0 (DE-588)4125422-3 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Perfekter Graph |0 (DE-588)4173735-0 |D s |
| 689 | 0 | 1 | |a Effizienter Algorithmus |0 (DE-588)4125422-3 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Graphentheorie |0 (DE-588)4113782-6 |D s |
| 689 | 1 | 1 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 1 | |5 DE-604 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-002949541 | ||
Datensatz im Suchindex
| _version_ | 1804118907635630080 |
|---|---|
| any_adam_object | |
| author | Simon, Klaus 1958- |
| author_GND | (DE-588)140611193 |
| author_facet | Simon, Klaus 1958- |
| author_role | aut |
| author_sort | Simon, Klaus 1958- |
| author_variant | k s ks |
| building | Verbundindex |
| bvnumber | BV004793964 |
| classification_rvk | SK 890 ST 130 ST 134 |
| classification_tum | DAT 537f |
| ctrlnum | (OCoLC)75246506 (DE-599)BVBBV004793964 |
| discipline | Informatik Mathematik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01747nam a2200493 c 4500</leader><controlfield tag="001">BV004793964</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20210202 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">920224s1992 d||| |||| 00||| ger d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3519029405</subfield><subfield code="9">3-519-02940-5</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">3519029409</subfield><subfield code="9">3-519-02940-9</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)75246506</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV004793964</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-473</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-M347</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-29T</subfield><subfield code="a">DE-355</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-188</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 890</subfield><subfield code="0">(DE-625)143267:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 130</subfield><subfield code="0">(DE-625)143588:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 134</subfield><subfield code="0">(DE-625)143590:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 537f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">05C85</subfield><subfield code="2">msc</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">05C60</subfield><subfield code="2">msc</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">68R10</subfield><subfield code="2">msc</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Simon, Klaus</subfield><subfield code="d">1958-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)140611193</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Effiziente Algorithmen für perfekte Graphen</subfield><subfield code="c">von Klaus Simon</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Stuttgart</subfield><subfield code="b">Teubner</subfield><subfield code="c">1992</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">VIII, 286 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="0" ind2=" "><subfield code="a">Leitfäden und Monographien der Informatik</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Literaturverz. S. [273] - 281</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Graphentheorie</subfield><subfield code="0">(DE-588)4113782-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Perfekter Graph</subfield><subfield code="0">(DE-588)4173735-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Effizienter Algorithmus</subfield><subfield code="0">(DE-588)4125422-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Perfekter Graph</subfield><subfield code="0">(DE-588)4173735-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Effizienter Algorithmus</subfield><subfield code="0">(DE-588)4125422-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Graphentheorie</subfield><subfield code="0">(DE-588)4113782-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-002949541</subfield></datafield></record></collection> |
| id | DE-604.BV004793964 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T16:17:45Z |
| institution | BVB |
| isbn | 3519029405 |
| language | German |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-002949541 |
| oclc_num | 75246506 |
| open_access_boolean | |
| owner | DE-473 DE-BY-UBG DE-739 DE-91G DE-BY-TUM DE-M347 DE-20 DE-29T DE-355 DE-BY-UBR DE-706 DE-634 DE-83 DE-11 DE-188 |
| owner_facet | DE-473 DE-BY-UBG DE-739 DE-91G DE-BY-TUM DE-M347 DE-20 DE-29T DE-355 DE-BY-UBR DE-706 DE-634 DE-83 DE-11 DE-188 |
| physical | VIII, 286 S. graph. Darst. |
| publishDate | 1992 |
| publishDateSearch | 1992 |
| publishDateSort | 1992 |
| publisher | Teubner |
| record_format | marc |
| series2 | Leitfäden und Monographien der Informatik |
| spelling | Simon, Klaus 1958- Verfasser (DE-588)140611193 aut Effiziente Algorithmen für perfekte Graphen von Klaus Simon Stuttgart Teubner 1992 VIII, 286 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Leitfäden und Monographien der Informatik Literaturverz. S. [273] - 281 Graphentheorie (DE-588)4113782-6 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf Perfekter Graph (DE-588)4173735-0 gnd rswk-swf Effizienter Algorithmus (DE-588)4125422-3 gnd rswk-swf Perfekter Graph (DE-588)4173735-0 s Effizienter Algorithmus (DE-588)4125422-3 s DE-604 Graphentheorie (DE-588)4113782-6 s Algorithmus (DE-588)4001183-5 s |
| spellingShingle | Simon, Klaus 1958- Effiziente Algorithmen für perfekte Graphen Graphentheorie (DE-588)4113782-6 gnd Algorithmus (DE-588)4001183-5 gnd Perfekter Graph (DE-588)4173735-0 gnd Effizienter Algorithmus (DE-588)4125422-3 gnd |
| subject_GND | (DE-588)4113782-6 (DE-588)4001183-5 (DE-588)4173735-0 (DE-588)4125422-3 |
| title | Effiziente Algorithmen für perfekte Graphen |
| title_auth | Effiziente Algorithmen für perfekte Graphen |
| title_exact_search | Effiziente Algorithmen für perfekte Graphen |
| title_full | Effiziente Algorithmen für perfekte Graphen von Klaus Simon |
| title_fullStr | Effiziente Algorithmen für perfekte Graphen von Klaus Simon |
| title_full_unstemmed | Effiziente Algorithmen für perfekte Graphen von Klaus Simon |
| title_short | Effiziente Algorithmen für perfekte Graphen |
| title_sort | effiziente algorithmen fur perfekte graphen |
| topic | Graphentheorie (DE-588)4113782-6 gnd Algorithmus (DE-588)4001183-5 gnd Perfekter Graph (DE-588)4173735-0 gnd Effizienter Algorithmus (DE-588)4125422-3 gnd |
| topic_facet | Graphentheorie Algorithmus Perfekter Graph Effizienter Algorithmus |
| work_keys_str_mv | AT simonklaus effizientealgorithmenfurperfektegraphen |