Static and dynamic graph partitioning: a comparative study of existing algorithms
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Abschlussarbeit Buch |
| Sprache: | English |
| Veröffentlicht: |
Berlin
Logos-Verl.
2002
|
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | X, 176 S. graph. Darst. : 24 cm |
| ISBN: | 3897229234 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV014393077 | ||
| 003 | DE-604 | ||
| 005 | 20021105 | ||
| 007 | t | ||
| 008 | 020618s2002 gw d||| m||| 00||| eng d | ||
| 016 | 7 | |a 964565315 |2 DE-101 | |
| 020 | |a 3897229234 |c kart. : EUR 40.50 (DE), EUR 41.60 (AT), sfr 72.10 |9 3-89722-923-4 | ||
| 035 | |a (OCoLC)52270944 | ||
| 035 | |a (DE-599)BVBBV014393077 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 044 | |a gw |c DE | ||
| 049 | |a DE-29T |a DE-706 |a DE-188 | ||
| 082 | 0 | |a 518.1 |2 22 | |
| 100 | 1 | |a Elsner, Ulrich |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Static and dynamic graph partitioning |b a comparative study of existing algorithms |c vogelegt von Ulrich Elsner |
| 264 | 1 | |a Berlin |b Logos-Verl. |c 2002 | |
| 300 | |a X, 176 S. |b graph. Darst. : 24 cm | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 502 | |a Chemnitz, Techn. Univ., Diss., 2002 | ||
| 650 | 0 | 7 | |a Graph |0 (DE-588)4021842-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Dekomposition |0 (DE-588)4149030-7 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 689 | 0 | 0 | |a Graph |0 (DE-588)4021842-9 |D s |
| 689 | 0 | 1 | |a Dekomposition |0 (DE-588)4149030-7 |D s |
| 689 | 0 | 2 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 0 | |5 DE-604 | |
| 856 | 4 | 2 | |m DNB Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=009852572&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-009852572 | |
Datensatz im Suchindex
| _version_ | 1808136333209632768 |
|---|---|
| adam_text |
CONTENTS
INTRODUCTION
V
NOTATION
IX
1
THE
PROBLEM
1
1.1
INTRODUCTION
.
1
1.2
GRAPH
PARTITIONING
.
2
1.3
EXAMPLES
.
5
1.3.1
PARTIAL
DIFFERENTIAL
EQUATIONS
.
5
1.3.2
SPARSE
MATRIX-VECTOR
MULTIPLICATION
.
7
1.3.3
OTHER
APPLICATIONS
.
10
1.4
TIME
VS.
QUALITY
.
10
2
MISCELLANEOUS
ALGORITHMS
13
2.1
INTRODUCTION
.
13
2.2
RECURSIVE
BISECTION
.
13
2.3
PARTITIONING
WITH
GEOMETRIC
INFORMATION
.
17
2.3.1
COORDINATE
BISECTION
.
18
2.3.2
INERTIAL
BISECTION
.
19
2.3.3
SPACEFILLING
CURVES
.
21
2.3.4
GEOMETRIC
PARTITIONING
.
24
3
PARTITIONING
WITHOUT
GEOMETRIC
INFORMATION
29
3.1
INTRODUCTION
.
29
3.2
GRAPH
GROWING
AND
GREEDY
ALGORITHMS
.
29
3.3
KERNIGHAN-LIN
ALGORITHM
.
31
3.4
HELPFUL
SETS
.
35
3.4.1
FINDING
HELPFUL
AND
BALANCING
SETS
.
37
3.5
SPECTRAL
BISECTION
.
41
CONTENTS
3.5.1
PREPARATIONS
.
41
3.5.2
SIMPLE
SPECTRAL
BISECTION
.
44
3.5.3
A
COUNTEREXAMPLE
.
48
3.5.4
SPECTRAL
BISECTION
FOR
WEIGHTED
GRAPHS
.
49
3.5.5
SPECTRAL
QUADRI
AND
OCTASECTION
.
51
3.5.6
EIGENVECTORS
AS
EUCLIDIAN
SPACE
.
53
3.5.7
MULTILEVEL
SPECTRAL
BISECTION
.
55
3.5.8
ALGEBRAIC
MULTILEVEL
.
59
3.6
MULTILEVEL
PARTITIONING
.
61
3.6.1
COARSENING
THE
GRAPH
.
62
3.6.2
PARTITIONING
THE
SMALLEST
GRAPH
.
65
3.6.3
PROJECTING
UP
AND
REFINING
THE
PARTITION
.
66
3.7
OTHER
METHODS
.
66
4
DYNAMIC
GRAPH
PARTITIONING
67
4.1
INTRODUCTION
.
67
4.1.1
DYNAMIC
GRAPH
PARTITIONING
.
67
4.1.2
EXAMPLES
.
70
4.1.3
SIMPLIFICATIONS
.
72
4.2
INTELLIGENT
REASSIGNMENT
.
72
4.3
DIFFUSION
TYPE
ALGORITHMS
.
78
4.3.1
DIRECTED
AND
UNDIRECTED
DIFFUSION
.
78
4.3.2
HU
AND
BLAKE
'
S
ALGORITHM
.
79
4.3.3
MOVING
VERTICES
.
82
4.3.4
MULTILEVEL
DIFFUSION
ALGORITHMS
.
86
4.4
HARP
IN
A
DYNAMIC
SETTING
.
89
5
COMPUTATIONAL
RESULTS
91
5.1
INTRODUCTION
.
91
5.1.1
PRESENTATION
OF
RESULTS
.
91
5.2
STATIC
GRAPH
PARTITIONING
.
92
5.2.1
THE
GRAPHS
.
92
5.2.2
THE
ALGORITHMS
FOR
STATIC
GRAPH
PARTITIONING
.
94
5.2.3
INFLUENCE
OF
PARAMETERS
.
97
5.2.4
PERFORMANCE
OF
DIFFERENT
ALGORITHMS
.
116
5.2.5
RANDOM
DEVIATIONS
-
DEVIOUS
RANDOMIZATION
.
127
II
CONTENTS
5.2.6
PRACTICAL
APPLICATIONS
.
139
5.3
DYNAMIC
GRAPH
PARTITIONING
.
149
5.3.1
THE
ALGORITHMS
FOR
DYNAMIC
GRAPH
PARTITIONING
.
.
.
.150
5.3.2
THE
SCENARIOS
.
151
5.3.3
ANALYSIS
OF
RESULTS
.
153
5.3.4
CONCLUSION
.
163
BIBLIOGRAPHY
167
III |
| any_adam_object | 1 |
| author | Elsner, Ulrich |
| author_facet | Elsner, Ulrich |
| author_role | aut |
| author_sort | Elsner, Ulrich |
| author_variant | u e ue |
| building | Verbundindex |
| bvnumber | BV014393077 |
| ctrlnum | (OCoLC)52270944 (DE-599)BVBBV014393077 |
| dewey-full | 518.1 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 518 - Numerical analysis |
| dewey-raw | 518.1 |
| dewey-search | 518.1 |
| dewey-sort | 3518.1 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| format | Thesis Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 c 4500</leader><controlfield tag="001">BV014393077</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20021105</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">020618s2002 gw d||| m||| 00||| eng d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">964565315</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3897229234</subfield><subfield code="c">kart. : EUR 40.50 (DE), EUR 41.60 (AT), sfr 72.10</subfield><subfield code="9">3-89722-923-4</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)52270944</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV014393077</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">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">DE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-29T</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-188</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">518.1</subfield><subfield code="2">22</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Elsner, Ulrich</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Static and dynamic graph partitioning</subfield><subfield code="b">a comparative study of existing algorithms</subfield><subfield code="c">vogelegt von Ulrich Elsner</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin</subfield><subfield code="b">Logos-Verl.</subfield><subfield code="c">2002</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">X, 176 S.</subfield><subfield code="b">graph. Darst. : 24 cm</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="502" ind1=" " ind2=" "><subfield code="a">Chemnitz, Techn. Univ., Diss., 2002</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Graph</subfield><subfield code="0">(DE-588)4021842-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</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">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</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">Graph</subfield><subfield code="0">(DE-588)4021842-9</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">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="856" ind1="4" ind2="2"><subfield code="m">DNB 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=009852572&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-009852572</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV014393077 |
| illustrated | Illustrated |
| indexdate | 2024-08-23T00:33:00Z |
| institution | BVB |
| isbn | 3897229234 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-009852572 |
| oclc_num | 52270944 |
| open_access_boolean | |
| owner | DE-29T DE-706 DE-188 |
| owner_facet | DE-29T DE-706 DE-188 |
| physical | X, 176 S. graph. Darst. : 24 cm |
| publishDate | 2002 |
| publishDateSearch | 2002 |
| publishDateSort | 2002 |
| publisher | Logos-Verl. |
| record_format | marc |
| spelling | Elsner, Ulrich Verfasser aut Static and dynamic graph partitioning a comparative study of existing algorithms vogelegt von Ulrich Elsner Berlin Logos-Verl. 2002 X, 176 S. graph. Darst. : 24 cm txt rdacontent n rdamedia nc rdacarrier Chemnitz, Techn. Univ., Diss., 2002 Graph (DE-588)4021842-9 gnd rswk-swf Dekomposition (DE-588)4149030-7 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf (DE-588)4113937-9 Hochschulschrift gnd-content Graph (DE-588)4021842-9 s Dekomposition (DE-588)4149030-7 s Algorithmus (DE-588)4001183-5 s DE-604 DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=009852572&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Elsner, Ulrich Static and dynamic graph partitioning a comparative study of existing algorithms Graph (DE-588)4021842-9 gnd Dekomposition (DE-588)4149030-7 gnd Algorithmus (DE-588)4001183-5 gnd |
| subject_GND | (DE-588)4021842-9 (DE-588)4149030-7 (DE-588)4001183-5 (DE-588)4113937-9 |
| title | Static and dynamic graph partitioning a comparative study of existing algorithms |
| title_auth | Static and dynamic graph partitioning a comparative study of existing algorithms |
| title_exact_search | Static and dynamic graph partitioning a comparative study of existing algorithms |
| title_full | Static and dynamic graph partitioning a comparative study of existing algorithms vogelegt von Ulrich Elsner |
| title_fullStr | Static and dynamic graph partitioning a comparative study of existing algorithms vogelegt von Ulrich Elsner |
| title_full_unstemmed | Static and dynamic graph partitioning a comparative study of existing algorithms vogelegt von Ulrich Elsner |
| title_short | Static and dynamic graph partitioning |
| title_sort | static and dynamic graph partitioning a comparative study of existing algorithms |
| title_sub | a comparative study of existing algorithms |
| topic | Graph (DE-588)4021842-9 gnd Dekomposition (DE-588)4149030-7 gnd Algorithmus (DE-588)4001183-5 gnd |
| topic_facet | Graph Dekomposition Algorithmus Hochschulschrift |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=009852572&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT elsnerulrich staticanddynamicgraphpartitioningacomparativestudyofexistingalgorithms |