Degree constrained subgraph problems and network flow optimization:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Abschlussarbeit Buch |
| Sprache: | German |
| Veröffentlicht: |
Augsburg
Wißner
1997
|
| Schriftenreihe: | Augsburger mathematisch-naturwissenschaftliche Schriften
21 |
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | 172 S. Ill., graph. Darst. |
| ISBN: | 389639083X |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV011674598 | ||
| 003 | DE-604 | ||
| 005 | 20060131 | ||
| 007 | t | ||
| 008 | 971202s1997 gw ad|| m||| 00||| ger d | ||
| 016 | 7 | |a 952294508 |2 DE-101 | |
| 020 | |a 389639083X |9 3-89639-083-X | ||
| 035 | |a (OCoLC)312796971 | ||
| 035 | |a (DE-599)BVBBV011674598 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a ger | |
| 044 | |a gw |c DE | ||
| 049 | |a DE-37 |a DE-12 |a DE-384 |a DE-91 |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 MAT 904d |2 stub | ||
| 100 | 1 | |a Fremuth-Paeger, Christian |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Degree constrained subgraph problems and network flow optimization |c Christian Fremuth-Paeger |
| 264 | 1 | |a Augsburg |b Wißner |c 1997 | |
| 300 | |a 172 S. |b Ill., graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Augsburger mathematisch-naturwissenschaftliche Schriften |v 21 | |
| 502 | |a Zugl.: Augsburg, Univ., Diss., 1997 | ||
| 650 | 0 | 7 | |a Netzwerkfluss |0 (DE-588)4126130-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Kombinatorische Optimierung |0 (DE-588)4031826-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Matching-Problem |0 (DE-588)4198185-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Optimierung |0 (DE-588)4043664-0 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Relation |g Informatik |0 (DE-588)4212688-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Matching |0 (DE-588)4212483-9 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 689 | 0 | 0 | |a Matching |0 (DE-588)4212483-9 |D s |
| 689 | 0 | 1 | |a Relation |g Informatik |0 (DE-588)4212688-5 |D s |
| 689 | 0 | 2 | |a Netzwerkfluss |0 (DE-588)4126130-6 |D s |
| 689 | 0 | 3 | |a Optimierung |0 (DE-588)4043664-0 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Netzwerkfluss |0 (DE-588)4126130-6 |D s |
| 689 | 1 | 1 | |a Matching-Problem |0 (DE-588)4198185-6 |D s |
| 689 | 1 | 2 | |a Kombinatorische Optimierung |0 (DE-588)4031826-6 |D s |
| 689 | 1 | |5 DE-604 | |
| 830 | 0 | |a Augsburger mathematisch-naturwissenschaftliche Schriften |v 21 |w (DE-604)BV009824413 |9 21 | |
| 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=007870681&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-007870681 | |
Datensatz im Suchindex
| _version_ | 1807681787117174784 |
|---|---|
| adam_text |
CONTENTS
PREFACE
5
1
SUBGRAPH
PROBLEMS
AND
NETWORK
FLOWS
9
1.1
THE
CARDINALITY
MATCHING
PROBLEM
.
9
1.2
THE
EDMONDS
ALGORITHM
-
A
PARADIGM
OF
A
GOOD
COMBINATORIAL
ALGORITHM
.
13
1.3
PRINCIPLES
OF
NETWORK
FLOW
OPTIMIZATION
.
18
1.4
BASIC
DATA
STRUCTURES
AND
METHODS
.
23
1.5
GENERALIZED
MATCHING
PROBLEMS
.
30
1.6
BALANCED
FLOW
NETWORKS
.
33
2
AUGMENTATION
IN
BALANCED
FLOW
NETWORKS
37
2.1
BALANCED
AUGMENTATION
.
37
2.2
DISTANCE
LABELS
IN
BALANCED
NETWORKS
.
46
2.3
FRACTIONAL
BALANCED
FLOWS
.
52
2.4
CYCLE
CANCELING
ALGORITHMS
.
55
3
DESIGN
AND
ANALYSIS
OF
BNS
ALGORITHMS
67
3.1
TENACITY
LABELS
.
67
3.2
BLOSSOMS
AND
UNITS
.
74
3.3
SHRINKING
BLOSSOMS
.
83
3.4
TREE
GROWING
BNS
ALGORITHMS
.
91
3.5
THE
COMPOSITION
OF
MINIMUM
VALID
PATHS
.
95
4
ALGORITHMS
FOR
BALANCED
NETWORK
SEARCH
105
4.1
DISJOINT
SET
UNION
STRUCTURES
.
105
4.2
A
BREADTH
FIRST
BNS
ALGORITHM
.
112
4.3
A
DEPTH
FIRST
BNS
ALGORITHM
.
120
8
CONTENTS
4.4
DOUBLE
DEPTH
FIRST
SEARCH
.
127
4.5
FINDING
MINIMUM
VALID
PATHS
.
136
4.6
PHASE
ORDERED
ALGORITHMS
.
150
BIBLIOGRAPHY
161
LIST
OF
FIGURES
165
LIST
OF
PROCEDURES
166
LIST
OF
CLASSES
AND
METHODS
167
INDEX
169 |
| any_adam_object | 1 |
| author | Fremuth-Paeger, Christian |
| author_facet | Fremuth-Paeger, Christian |
| author_role | aut |
| author_sort | Fremuth-Paeger, Christian |
| author_variant | c f p cfp |
| building | Verbundindex |
| bvnumber | BV011674598 |
| classification_rvk | SK 890 ST 130 |
| classification_tum | MAT 904d |
| ctrlnum | (OCoLC)312796971 (DE-599)BVBBV011674598 |
| discipline | Informatik Mathematik |
| format | Thesis 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">BV011674598</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20060131</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">971202s1997 gw ad|| m||| 00||| ger d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">952294508</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">389639083X</subfield><subfield code="9">3-89639-083-X</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)312796971</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV011674598</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="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">DE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-37</subfield><subfield code="a">DE-12</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-91</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">MAT 904d</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Fremuth-Paeger, Christian</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Degree constrained subgraph problems and network flow optimization</subfield><subfield code="c">Christian Fremuth-Paeger</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Augsburg</subfield><subfield code="b">Wißner</subfield><subfield code="c">1997</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">172 S.</subfield><subfield code="b">Ill., 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">Augsburger mathematisch-naturwissenschaftliche Schriften</subfield><subfield code="v">21</subfield></datafield><datafield tag="502" ind1=" " ind2=" "><subfield code="a">Zugl.: Augsburg, Univ., Diss., 1997</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Netzwerkfluss</subfield><subfield code="0">(DE-588)4126130-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Kombinatorische Optimierung</subfield><subfield code="0">(DE-588)4031826-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Matching-Problem</subfield><subfield code="0">(DE-588)4198185-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Optimierung</subfield><subfield code="0">(DE-588)4043664-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Relation</subfield><subfield code="g">Informatik</subfield><subfield code="0">(DE-588)4212688-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Matching</subfield><subfield code="0">(DE-588)4212483-9</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">Matching</subfield><subfield code="0">(DE-588)4212483-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Relation</subfield><subfield code="g">Informatik</subfield><subfield code="0">(DE-588)4212688-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Netzwerkfluss</subfield><subfield code="0">(DE-588)4126130-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="3"><subfield code="a">Optimierung</subfield><subfield code="0">(DE-588)4043664-0</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">Netzwerkfluss</subfield><subfield code="0">(DE-588)4126130-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Matching-Problem</subfield><subfield code="0">(DE-588)4198185-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="2"><subfield code="a">Kombinatorische Optimierung</subfield><subfield code="0">(DE-588)4031826-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Augsburger mathematisch-naturwissenschaftliche Schriften</subfield><subfield code="v">21</subfield><subfield code="w">(DE-604)BV009824413</subfield><subfield code="9">21</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=007870681&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-007870681</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV011674598 |
| illustrated | Illustrated |
| indexdate | 2024-08-18T00:08:11Z |
| institution | BVB |
| isbn | 389639083X |
| language | German |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007870681 |
| oclc_num | 312796971 |
| open_access_boolean | |
| owner | DE-37 DE-12 DE-384 DE-91 DE-BY-TUM DE-188 |
| owner_facet | DE-37 DE-12 DE-384 DE-91 DE-BY-TUM DE-188 |
| physical | 172 S. Ill., graph. Darst. |
| publishDate | 1997 |
| publishDateSearch | 1997 |
| publishDateSort | 1997 |
| publisher | Wißner |
| record_format | marc |
| series | Augsburger mathematisch-naturwissenschaftliche Schriften |
| series2 | Augsburger mathematisch-naturwissenschaftliche Schriften |
| spelling | Fremuth-Paeger, Christian Verfasser aut Degree constrained subgraph problems and network flow optimization Christian Fremuth-Paeger Augsburg Wißner 1997 172 S. Ill., graph. Darst. txt rdacontent n rdamedia nc rdacarrier Augsburger mathematisch-naturwissenschaftliche Schriften 21 Zugl.: Augsburg, Univ., Diss., 1997 Netzwerkfluss (DE-588)4126130-6 gnd rswk-swf Kombinatorische Optimierung (DE-588)4031826-6 gnd rswk-swf Matching-Problem (DE-588)4198185-6 gnd rswk-swf Optimierung (DE-588)4043664-0 gnd rswk-swf Relation Informatik (DE-588)4212688-5 gnd rswk-swf Matching (DE-588)4212483-9 gnd rswk-swf (DE-588)4113937-9 Hochschulschrift gnd-content Matching (DE-588)4212483-9 s Relation Informatik (DE-588)4212688-5 s Netzwerkfluss (DE-588)4126130-6 s Optimierung (DE-588)4043664-0 s DE-604 Matching-Problem (DE-588)4198185-6 s Kombinatorische Optimierung (DE-588)4031826-6 s Augsburger mathematisch-naturwissenschaftliche Schriften 21 (DE-604)BV009824413 21 DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=007870681&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Fremuth-Paeger, Christian Degree constrained subgraph problems and network flow optimization Augsburger mathematisch-naturwissenschaftliche Schriften Netzwerkfluss (DE-588)4126130-6 gnd Kombinatorische Optimierung (DE-588)4031826-6 gnd Matching-Problem (DE-588)4198185-6 gnd Optimierung (DE-588)4043664-0 gnd Relation Informatik (DE-588)4212688-5 gnd Matching (DE-588)4212483-9 gnd |
| subject_GND | (DE-588)4126130-6 (DE-588)4031826-6 (DE-588)4198185-6 (DE-588)4043664-0 (DE-588)4212688-5 (DE-588)4212483-9 (DE-588)4113937-9 |
| title | Degree constrained subgraph problems and network flow optimization |
| title_auth | Degree constrained subgraph problems and network flow optimization |
| title_exact_search | Degree constrained subgraph problems and network flow optimization |
| title_full | Degree constrained subgraph problems and network flow optimization Christian Fremuth-Paeger |
| title_fullStr | Degree constrained subgraph problems and network flow optimization Christian Fremuth-Paeger |
| title_full_unstemmed | Degree constrained subgraph problems and network flow optimization Christian Fremuth-Paeger |
| title_short | Degree constrained subgraph problems and network flow optimization |
| title_sort | degree constrained subgraph problems and network flow optimization |
| topic | Netzwerkfluss (DE-588)4126130-6 gnd Kombinatorische Optimierung (DE-588)4031826-6 gnd Matching-Problem (DE-588)4198185-6 gnd Optimierung (DE-588)4043664-0 gnd Relation Informatik (DE-588)4212688-5 gnd Matching (DE-588)4212483-9 gnd |
| topic_facet | Netzwerkfluss Kombinatorische Optimierung Matching-Problem Optimierung Relation Informatik Matching Hochschulschrift |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=007870681&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| volume_link | (DE-604)BV009824413 |
| work_keys_str_mv | AT fremuthpaegerchristian degreeconstrainedsubgraphproblemsandnetworkflowoptimization |