Tree-partite graphs and the complexity of algorithms:
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Buch |
Sprache: | German |
Veröffentlicht: |
Berlin
1986
|
Schriftenreihe: | Karl-Weierstraß-Institut für Mathematik <Berlin, Ost>: Preprint
86,8. |
Schlagworte: | |
Beschreibung: | Zsfassungen in dt. u. russ. Sprache |
Beschreibung: | 63 S. graph. Darst. |
Internformat
MARC
LEADER | 00000nam a2200000 cb4500 | ||
---|---|---|---|
001 | BV007638430 | ||
003 | DE-604 | ||
007 | t | ||
008 | 930421s1986 d||| |||| 00||| ger d | ||
035 | |a (OCoLC)46013351 | ||
035 | |a (DE-599)BVBBV007638430 | ||
040 | |a DE-604 |b ger |e rakddb | ||
041 | 0 | |a ger | |
049 | |a DE-355 | ||
100 | 1 | |a Seese, Detlef |e Verfasser |0 (DE-588)108918505 |4 aut | |
245 | 1 | 0 | |a Tree-partite graphs and the complexity of algorithms |c Detlef Seese |
264 | 1 | |a Berlin |c 1986 | |
300 | |a 63 S. |b graph. Darst. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
490 | 1 | |a Karl-Weierstraß-Institut für Mathematik <Berlin, Ost>: Preprint |v 86,8. | |
500 | |a Zsfassungen in dt. u. russ. Sprache | ||
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 |
689 | 0 | 0 | |a Graphentheorie |0 (DE-588)4113782-6 |D s |
689 | 0 | 1 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
689 | 0 | |5 DE-604 | |
830 | 0 | |a Karl-Weierstraß-Institut für Mathematik <Berlin, Ost>: Preprint |v 86,8. |w (DE-604)BV006667941 |9 86,8 | |
943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-005002435 |
Datensatz im Suchindex
_version_ | 1810738969806110720 |
---|---|
adam_text | |
any_adam_object | |
author | Seese, Detlef |
author_GND | (DE-588)108918505 |
author_facet | Seese, Detlef |
author_role | aut |
author_sort | Seese, Detlef |
author_variant | d s ds |
building | Verbundindex |
bvnumber | BV007638430 |
ctrlnum | (OCoLC)46013351 (DE-599)BVBBV007638430 |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 cb4500</leader><controlfield tag="001">BV007638430</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">930421s1986 d||| |||| 00||| ger d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)46013351</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV007638430</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-355</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Seese, Detlef</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)108918505</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Tree-partite graphs and the complexity of algorithms</subfield><subfield code="c">Detlef Seese</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin</subfield><subfield code="c">1986</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">63 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">Karl-Weierstraß-Institut für Mathematik <Berlin, Ost>: Preprint</subfield><subfield code="v">86,8.</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Zsfassungen in dt. u. russ. Sprache</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="689" ind1="0" 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="0" 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="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Karl-Weierstraß-Institut für Mathematik <Berlin, Ost>: Preprint</subfield><subfield code="v">86,8.</subfield><subfield code="w">(DE-604)BV006667941</subfield><subfield code="9">86,8</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005002435</subfield></datafield></record></collection> |
id | DE-604.BV007638430 |
illustrated | Illustrated |
indexdate | 2024-09-20T18:00:48Z |
institution | BVB |
language | German |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005002435 |
oclc_num | 46013351 |
open_access_boolean | |
owner | DE-355 DE-BY-UBR |
owner_facet | DE-355 DE-BY-UBR |
physical | 63 S. graph. Darst. |
publishDate | 1986 |
publishDateSearch | 1986 |
publishDateSort | 1986 |
record_format | marc |
series | Karl-Weierstraß-Institut für Mathematik <Berlin, Ost>: Preprint |
series2 | Karl-Weierstraß-Institut für Mathematik <Berlin, Ost>: Preprint |
spelling | Seese, Detlef Verfasser (DE-588)108918505 aut Tree-partite graphs and the complexity of algorithms Detlef Seese Berlin 1986 63 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Karl-Weierstraß-Institut für Mathematik <Berlin, Ost>: Preprint 86,8. Zsfassungen in dt. u. russ. Sprache Graphentheorie (DE-588)4113782-6 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf Graphentheorie (DE-588)4113782-6 s Algorithmus (DE-588)4001183-5 s DE-604 Karl-Weierstraß-Institut für Mathematik <Berlin, Ost>: Preprint 86,8. (DE-604)BV006667941 86,8 |
spellingShingle | Seese, Detlef Tree-partite graphs and the complexity of algorithms Karl-Weierstraß-Institut für Mathematik <Berlin, Ost>: Preprint Graphentheorie (DE-588)4113782-6 gnd Algorithmus (DE-588)4001183-5 gnd |
subject_GND | (DE-588)4113782-6 (DE-588)4001183-5 |
title | Tree-partite graphs and the complexity of algorithms |
title_auth | Tree-partite graphs and the complexity of algorithms |
title_exact_search | Tree-partite graphs and the complexity of algorithms |
title_full | Tree-partite graphs and the complexity of algorithms Detlef Seese |
title_fullStr | Tree-partite graphs and the complexity of algorithms Detlef Seese |
title_full_unstemmed | Tree-partite graphs and the complexity of algorithms Detlef Seese |
title_short | Tree-partite graphs and the complexity of algorithms |
title_sort | tree partite graphs and the complexity of algorithms |
topic | Graphentheorie (DE-588)4113782-6 gnd Algorithmus (DE-588)4001183-5 gnd |
topic_facet | Graphentheorie Algorithmus |
volume_link | (DE-604)BV006667941 |
work_keys_str_mv | AT seesedetlef treepartitegraphsandthecomplexityofalgorithms |