Time and space efficient algorithms for decomposing certain partially ordered sets:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Abschlussarbeit Buch |
| Sprache: | English |
| Veröffentlicht: |
Bayreuth
Mathematisches Inst. der Univ.
2002
|
| Ausgabe: | 1. print. |
| Schriftenreihe: | Bayreuther mathematische Schriften
65 |
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | 121 S. graph. Darst. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV014837423 | ||
| 003 | DE-604 | ||
| 005 | 20050930 | ||
| 007 | t | ||
| 008 | 021030s2002 d||| m||| 00||| eng d | ||
| 035 | |a (OCoLC)51693713 | ||
| 035 | |a (DE-599)BVBBV014837423 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-384 |a DE-355 |a DE-12 |a DE-22 |a DE-703 |a DE-91G |a DE-634 |a DE-188 | ||
| 084 | |a SI 170 |0 (DE-625)143087: |2 rvk | ||
| 100 | 1 | |a Goeman, Heiko |d 1971- |e Verfasser |0 (DE-588)121937917 |4 aut | |
| 245 | 1 | 0 | |a Time and space efficient algorithms for decomposing certain partially ordered sets |c Heiko Goeman |
| 250 | |a 1. print. | ||
| 264 | 1 | |a Bayreuth |b Mathematisches Inst. der Univ. |c 2002 | |
| 300 | |a 121 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Bayreuther mathematische Schriften |v 65 | |
| 502 | |a Zugl.: Bonn, Univ., Diss., 2000 | ||
| 650 | 7 | |a Hochschulschrift |2 gtt | |
| 650 | 0 | 7 | |a Dekomposition |0 (DE-588)4149030-7 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Halbgeordnete Menge |0 (DE-588)4128951-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Effizienter Algorithmus |0 (DE-588)4125422-3 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 689 | 0 | 0 | |a Halbgeordnete Menge |0 (DE-588)4128951-1 |D s |
| 689 | 0 | 1 | |a Dekomposition |0 (DE-588)4149030-7 |D s |
| 689 | 0 | 2 | |a Effizienter Algorithmus |0 (DE-588)4125422-3 |D s |
| 689 | 0 | |5 DE-604 | |
| 830 | 0 | |a Bayreuther mathematische Schriften |v 65 |w (DE-604)BV037222321 |9 65 | |
| 856 | 4 | 2 | |m HBZ Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=010039552&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-010039552 | ||
Datensatz im Suchindex
| _version_ | 1804129608194326528 |
|---|---|
| adam_text | Titel: Time and space efficient algorithms for decomposing certain partially ordered sets
Autor: Goeman, Heiko
Jahr: 2002
Contents
1 Introduction 5
2 Theoretical Background 11
2.1 Basic Results..............................................11
2.2 A Linear Space MOC Algorithm........................14
2.3 Computing All Longest Chains..........................17
3 Rick s Algorithm 25
4 The New Decomposition Method 35
4.1 Dualization of Rick s Method............................35
4.2 The ^-invariant..........................................45
4.3 Program Code ............................................47
4.4 Complexity Analysis......................................52
5 Linear Space LCS Construction 53
5.1 Locating Two Centered Matches........................53
5.2 Program Code ............................................57
5.3 Complexity Analysis......................................62
6 The AMOC Problem 69
6.1 Generating the AMOC-Graph ..........................70
6.2 Border LCS................................................73
6.3 Program Code ............................................85
6.4 Complexity Analysis......................................94
3
4 CONTENTS
7 Experimental Results 97
Bibliography 105
|
| any_adam_object | 1 |
| author | Goeman, Heiko 1971- |
| author_GND | (DE-588)121937917 |
| author_facet | Goeman, Heiko 1971- |
| author_role | aut |
| author_sort | Goeman, Heiko 1971- |
| author_variant | h g hg |
| building | Verbundindex |
| bvnumber | BV014837423 |
| classification_rvk | SI 170 |
| ctrlnum | (OCoLC)51693713 (DE-599)BVBBV014837423 |
| discipline | Mathematik |
| edition | 1. print. |
| format | Thesis Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01803nam a2200421 cb4500</leader><controlfield tag="001">BV014837423</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20050930 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">021030s2002 d||| m||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)51693713</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV014837423</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-384</subfield><subfield code="a">DE-355</subfield><subfield code="a">DE-12</subfield><subfield code="a">DE-22</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-188</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SI 170</subfield><subfield code="0">(DE-625)143087:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Goeman, Heiko</subfield><subfield code="d">1971-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)121937917</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Time and space efficient algorithms for decomposing certain partially ordered sets</subfield><subfield code="c">Heiko Goeman</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">1. print.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Bayreuth</subfield><subfield code="b">Mathematisches Inst. der Univ.</subfield><subfield code="c">2002</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">121 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">Bayreuther mathematische Schriften</subfield><subfield code="v">65</subfield></datafield><datafield tag="502" ind1=" " ind2=" "><subfield code="a">Zugl.: Bonn, Univ., Diss., 2000</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Hochschulschrift</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Dekomposition</subfield><subfield code="0">(DE-588)4149030-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Halbgeordnete Menge</subfield><subfield code="0">(DE-588)4128951-1</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="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="689" ind1="0" ind2="0"><subfield code="a">Halbgeordnete Menge</subfield><subfield code="0">(DE-588)4128951-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Dekomposition</subfield><subfield code="0">(DE-588)4149030-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><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="830" ind1=" " ind2="0"><subfield code="a">Bayreuther mathematische Schriften</subfield><subfield code="v">65</subfield><subfield code="w">(DE-604)BV037222321</subfield><subfield code="9">65</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">HBZ Datenaustausch</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=010039552&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-010039552</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV014837423 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T19:07:50Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-010039552 |
| oclc_num | 51693713 |
| open_access_boolean | |
| owner | DE-384 DE-355 DE-BY-UBR DE-12 DE-22 DE-BY-UBG DE-703 DE-91G DE-BY-TUM DE-634 DE-188 |
| owner_facet | DE-384 DE-355 DE-BY-UBR DE-12 DE-22 DE-BY-UBG DE-703 DE-91G DE-BY-TUM DE-634 DE-188 |
| physical | 121 S. graph. Darst. |
| publishDate | 2002 |
| publishDateSearch | 2002 |
| publishDateSort | 2002 |
| publisher | Mathematisches Inst. der Univ. |
| record_format | marc |
| series | Bayreuther mathematische Schriften |
| series2 | Bayreuther mathematische Schriften |
| spelling | Goeman, Heiko 1971- Verfasser (DE-588)121937917 aut Time and space efficient algorithms for decomposing certain partially ordered sets Heiko Goeman 1. print. Bayreuth Mathematisches Inst. der Univ. 2002 121 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Bayreuther mathematische Schriften 65 Zugl.: Bonn, Univ., Diss., 2000 Hochschulschrift gtt Dekomposition (DE-588)4149030-7 gnd rswk-swf Halbgeordnete Menge (DE-588)4128951-1 gnd rswk-swf Effizienter Algorithmus (DE-588)4125422-3 gnd rswk-swf (DE-588)4113937-9 Hochschulschrift gnd-content Halbgeordnete Menge (DE-588)4128951-1 s Dekomposition (DE-588)4149030-7 s Effizienter Algorithmus (DE-588)4125422-3 s DE-604 Bayreuther mathematische Schriften 65 (DE-604)BV037222321 65 HBZ Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=010039552&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Goeman, Heiko 1971- Time and space efficient algorithms for decomposing certain partially ordered sets Bayreuther mathematische Schriften Hochschulschrift gtt Dekomposition (DE-588)4149030-7 gnd Halbgeordnete Menge (DE-588)4128951-1 gnd Effizienter Algorithmus (DE-588)4125422-3 gnd |
| subject_GND | (DE-588)4149030-7 (DE-588)4128951-1 (DE-588)4125422-3 (DE-588)4113937-9 |
| title | Time and space efficient algorithms for decomposing certain partially ordered sets |
| title_auth | Time and space efficient algorithms for decomposing certain partially ordered sets |
| title_exact_search | Time and space efficient algorithms for decomposing certain partially ordered sets |
| title_full | Time and space efficient algorithms for decomposing certain partially ordered sets Heiko Goeman |
| title_fullStr | Time and space efficient algorithms for decomposing certain partially ordered sets Heiko Goeman |
| title_full_unstemmed | Time and space efficient algorithms for decomposing certain partially ordered sets Heiko Goeman |
| title_short | Time and space efficient algorithms for decomposing certain partially ordered sets |
| title_sort | time and space efficient algorithms for decomposing certain partially ordered sets |
| topic | Hochschulschrift gtt Dekomposition (DE-588)4149030-7 gnd Halbgeordnete Menge (DE-588)4128951-1 gnd Effizienter Algorithmus (DE-588)4125422-3 gnd |
| topic_facet | Hochschulschrift Dekomposition Halbgeordnete Menge Effizienter Algorithmus |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=010039552&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| volume_link | (DE-604)BV037222321 |
| work_keys_str_mv | AT goemanheiko timeandspaceefficientalgorithmsfordecomposingcertainpartiallyorderedsets |