Efficient polynomial-time algorithms for special graph partitioning problems:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Abschlussarbeit Buch |
| Sprache: | English |
| Veröffentlicht: |
München
Verl. Dr. Hut
2011
|
| Ausgabe: | 1. Aufl. |
| Schriftenreihe: | Informatik
|
| Schlagworte: | |
| Beschreibung: | III, 174 S. graph. Darst. |
| ISBN: | 9783843900201 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV039537697 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 110822s2011 d||| m||| 00||| eng d | ||
| 020 | |a 9783843900201 |9 978-3-8439-0020-1 | ||
| 035 | |a (OCoLC)750894233 | ||
| 035 | |a (DE-599)HBZHT016924931 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-12 |a DE-91 | ||
| 100 | 1 | |a Pardella, Gregor Leszek |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Efficient polynomial-time algorithms for special graph partitioning problems |c vorgelegt von Gregor Leszek Pardella |
| 250 | |a 1. Aufl. | ||
| 264 | 1 | |a München |b Verl. Dr. Hut |c 2011 | |
| 300 | |a III, 174 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 0 | |a Informatik | |
| 502 | |a Zugl.: Köln, Univ., Diss., 2011 | ||
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-024389858 | ||
Datensatz im Suchindex
| _version_ | 1804148352565116928 |
|---|---|
| any_adam_object | |
| author | Pardella, Gregor Leszek |
| author_facet | Pardella, Gregor Leszek |
| author_role | aut |
| author_sort | Pardella, Gregor Leszek |
| author_variant | g l p gl glp |
| building | Verbundindex |
| bvnumber | BV039537697 |
| ctrlnum | (OCoLC)750894233 (DE-599)HBZHT016924931 |
| edition | 1. Aufl. |
| format | Thesis Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00956nam a2200301 c 4500</leader><controlfield tag="001">BV039537697</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">110822s2011 d||| m||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783843900201</subfield><subfield code="9">978-3-8439-0020-1</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)750894233</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)HBZHT016924931</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="049" ind1=" " ind2=" "><subfield code="a">DE-12</subfield><subfield code="a">DE-91</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Pardella, Gregor Leszek</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Efficient polynomial-time algorithms for special graph partitioning problems</subfield><subfield code="c">vorgelegt von Gregor Leszek Pardella</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">1. Aufl.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">München</subfield><subfield code="b">Verl. Dr. Hut</subfield><subfield code="c">2011</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">III, 174 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">Informatik</subfield></datafield><datafield tag="502" ind1=" " ind2=" "><subfield code="a">Zugl.: Köln, Univ., Diss., 2011</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4113937-9</subfield><subfield code="a">Hochschulschrift</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-024389858</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV039537697 |
| illustrated | Illustrated |
| indexdate | 2024-07-10T00:05:46Z |
| institution | BVB |
| isbn | 9783843900201 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-024389858 |
| oclc_num | 750894233 |
| open_access_boolean | |
| owner | DE-12 DE-91 DE-BY-TUM |
| owner_facet | DE-12 DE-91 DE-BY-TUM |
| physical | III, 174 S. graph. Darst. |
| publishDate | 2011 |
| publishDateSearch | 2011 |
| publishDateSort | 2011 |
| publisher | Verl. Dr. Hut |
| record_format | marc |
| series2 | Informatik |
| spelling | Pardella, Gregor Leszek Verfasser aut Efficient polynomial-time algorithms for special graph partitioning problems vorgelegt von Gregor Leszek Pardella 1. Aufl. München Verl. Dr. Hut 2011 III, 174 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Informatik Zugl.: Köln, Univ., Diss., 2011 (DE-588)4113937-9 Hochschulschrift gnd-content |
| spellingShingle | Pardella, Gregor Leszek Efficient polynomial-time algorithms for special graph partitioning problems |
| subject_GND | (DE-588)4113937-9 |
| title | Efficient polynomial-time algorithms for special graph partitioning problems |
| title_auth | Efficient polynomial-time algorithms for special graph partitioning problems |
| title_exact_search | Efficient polynomial-time algorithms for special graph partitioning problems |
| title_full | Efficient polynomial-time algorithms for special graph partitioning problems vorgelegt von Gregor Leszek Pardella |
| title_fullStr | Efficient polynomial-time algorithms for special graph partitioning problems vorgelegt von Gregor Leszek Pardella |
| title_full_unstemmed | Efficient polynomial-time algorithms for special graph partitioning problems vorgelegt von Gregor Leszek Pardella |
| title_short | Efficient polynomial-time algorithms for special graph partitioning problems |
| title_sort | efficient polynomial time algorithms for special graph partitioning problems |
| topic_facet | Hochschulschrift |
| work_keys_str_mv | AT pardellagregorleszek efficientpolynomialtimealgorithmsforspecialgraphpartitioningproblems |