Applications of graph theory algorithms:
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
New York [u.a.]
North Holland
1979
|
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | IX, 421 S. graph. Darst. |
| ISBN: | 0444002685 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV002245790 | ||
| 003 | DE-604 | ||
| 005 | 20210609 | ||
| 007 | t | ||
| 008 | 890928s1979 d||| |||| 00||| eng d | ||
| 020 | |a 0444002685 |9 0-444-00268-5 | ||
| 035 | |a (OCoLC)728061713 | ||
| 035 | |a (DE-599)BVBBV002245790 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-12 |a DE-384 |a DE-473 |a DE-703 |a DE-739 |a DE-29T |a DE-19 |a DE-706 |a DE-83 |a DE-188 | ||
| 050 | 0 | |a QA166C44 1979 | |
| 082 | 0 | |a 511.5 | |
| 084 | |a QH 400 |0 (DE-625)141571: |2 rvk | ||
| 084 | |a QH 451 |0 (DE-625)141594: |2 rvk | ||
| 084 | |a SK 170 |0 (DE-625)143221: |2 rvk | ||
| 084 | |a SK 890 |0 (DE-625)143267: |2 rvk | ||
| 084 | |a SK 900 |0 (DE-625)143268: |2 rvk | ||
| 084 | |a 05Cxx |2 msc | ||
| 084 | |a 68E10 |2 msc | ||
| 100 | 1 | |a Chachra, Vinod |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Applications of graph theory algorithms |c Vinod Chachra ; Prabhakar M. Ghare ; James M. Moore |
| 264 | 1 | |a New York [u.a.] |b North Holland |c 1979 | |
| 300 | |a IX, 421 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 650 | 4 | |a Algorithmes | |
| 650 | 7 | |a Algorithmes |2 ram | |
| 650 | 7 | |a Graphes, Théorie des |2 ram | |
| 650 | 4 | |a Théorie des graphes | |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Graphentheorie |0 (DE-588)4113782-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Anwendung |0 (DE-588)4196864-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 | 2 | |a Anwendung |0 (DE-588)4196864-5 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Graphentheorie |0 (DE-588)4113782-6 |D s |
| 689 | 1 | 1 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 1 | |5 DE-604 | |
| 700 | 1 | |a Ghare, Prabhakar M. |e Verfasser |4 aut | |
| 700 | 1 | |a Moore, James M. |e Verfasser |4 aut | |
| 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=001475889&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-001475889 | ||
| 980 | 4 | |a (DE-12)AK3940431 | |
| 980 | 4 | |a (DE-12)AK08020129 | |
| 980 | 4 | |a (DE-12)AK15260355 | |
Datensatz im Suchindex
| _version_ | 1804116701896245248 |
|---|---|
| adam_text | Contents
Preface ix
Chapter One Basic Concepts I
1.1 Historical 1
1.2 Graphs 4
1.3 Vertices 5
1.4 Edges, Edge Sequences, and Connectedness 7
1.5 Planar and Nonplanar Graphs 10
1.6 Separable and Nonseparable Graphs 15
1.7 Directed Graphs 16
1.8 Trees 18
1.9 Cutsets 21
1.10 Introduction to Matrices—A Review 21
1.11 Vectors and Vector Spaces—A Review 24
1.12 Mod 2 and Boolean Arithmetic—A Review 25
1.13 Matrices Associated with Graphs 26
1.14 A Mnemonic Scheme for Algorithm Description 36
1.15 Summary of Definitions 37
Exercises 42
Chapter Two Algorithms for Paths and Trees 49
2.1 Introduction 49
2.2 (P/S/D): Algorithm to Determine a Path—from an
Adjacency Matrix 50
Contents
2.3 (P/B/D): Algorithm Identifying a Path—from an
Incidence Matrix 52
2.4 (PS-l/L/D): Dijkstra s Algorithm to Locate the Shortest
Path—Given a Distance Matrix of a Directed Graph 54
2.5 (PS- 2/L/D): Algorithm to Identify a Shortest Path—from
the Distance Matrix 57
2.6 (PL/L/D): Algorithm to Identify a Longest Path—from
the Distance Matrix 59
2.7 (T- 1/B/U): Algorithm for Identifying a Spanning Tree—
from an Incidence Matrix 62
2.8 (T-2/S/U): Algorithm to Identify a Spanning Tree—from
an Adjacency Matrix 63
2.9 (T-3/S/D): Algorithm to Find a Spanning Tree—Given
the Adjacency Matrix of a Directed Graph 65
2.10 (TSS- 1/L/U): Kruskal s Algorithm for a Shortest
Spanning Tree—Given a Distance Matrix for an Undirected
Graph 67
2.11 (TSS-2/L/U): Solin s Algorithm for the Shortest
Spanning Tree 71
2.12 (PS-3/L/D): The Revised Cascade Algorithm 73
Chapter Three Network Flows and Graph Traversing 79
3.1 Flows and Potentials 80
3.2 Flows and Capacity Constraints 86
3.3 The Transportation Problem 92
3.4 Feasible and Maximal Flows 96
3.5 Traversing a Graph 97
3.6 Unicursal Graphs and Euler Graphs 98
3.7 The Chinese Postman Problem 101
3.8 Coverings and Matchings 104
3.9 Hamiltonian Paths and Cycles 106
Exercises 108
Chapter Four Algorithms for Circuits and Flow 111
4.1 (C/B/U): Algorithm to Obtain a Circuit Basis Matrix from
the Incidence Matrix 111
4.2 (CE/B/U): Algorithm Locating an Euler Circuit from the
Incidence Matrix 113
4.3 (CE/S/U): Algorithm Locating an Euler Circuit from an
Adjacency Matrix for an Undirected Graph 114
4.4 (CE-CPP/L/U): Algorithm Identifying the Minimum
Distance Euler Circuit 117
IF
Contents
4.5 (CE/S/D): Algorithm Identifying an Euler Cycle from an
Adjacency Matrix 119
4.6 (FM-l/S/D): Algorithm Determining Maximal Flow in a
Capacitated Network 122
4.7 (FM-2/S/D): Algorithm Determining Maximal Flow in a
Capacitated Planar Network 124
4.8 (FM-3/S/D): Ford and Fulkerson Algorithm for Maximal
Flow Given an Adjacency Matrix 127
4.9 (FO-S/D): Algorithm Identifying Least Cost Flow (or
Optimal) in a Capacitated Network 129
4.10 (K/B/U): Algorithm to Obtain a Cutset Basis Matrix from
an Incidence Matrix 133
4.11 (PH/S/D): Kaufmann s Algorithm to Identify a
Hamiltonian Path—from an Adjacency Matrix 134
4.12 Algorithm for the Assignment Problem 137
Chapter Five Activity Schedules 143
5.1 Performance Evaluation and Review Technique 143
5.2 PERT in Plant Modernization: A Case History 154
5.3 Critical Path Method (CPM) 166
Exercises 169
Chapter Six Construction 187
6.1 Highway Route Planning 187
6.2 Earthwork Planning 193
6.3 Pier Construction Planning 197
6.4 Sewer Main Planning 210
Exercises 217
Chapter Seven Sequencing and Line Balancing 232
7.1 Sequencing 232
7.2 Assembly Line Balancing 236
7.3 Disassembly Line Balancing 238
Exercises 240
Chapter Eight Facilities Design 246
8.1 Block Plan Layout as a Planar Graph 247
8.2 Feasibility of a Facility Plan 250
8.3 Upper Bounds to Facilities Design Problem 262
8.4 Golf Course Design 266
8.5 Relocation of Machinery 266
8.6 Materials Handling System Installation 269
Exercises 273
v
Contents
Chapter Nine Electrical Energy 283
9.1 Circuit Analysis and Design 283
9.2 Printed Circuits 288
9.3 Computer Utilities 291
9.4 Television Relay Networks 296
9.5 Electrical Power Grids 298
Exercises 301
Chapter Ten Pipeline Flows, Transportation and Traffic 309
10.1 Maximum Flow Through a Pipeline 310
10.2 Natural Gas Pipeline Systems 316
10.3 Commuter Traffic 324
10.4 Airline Scheduling 328
10.5 Fisherman s Problem 334
10.6 Railroad Schedules on a Crowded Line 336
Exercises 338
Chapter Eleven Production Planning and Control 349
11.1 Parts Breakdown 349
11.2 Machining Process Optimization 354
11.3 Worker Assignment 358
11.4 Machine Maintenance 364
11.5 Decision Trees 371
Exercises 372
Chapter Twelve Organization 379
12.1 Classification Structure for Air Force Officers 379
12.2 Manufacturing Organization Structures 385
12.3 An Example in Communications 389
12.4 (r/S/U, d/S/U, c/S/U): Algorithm Identifying the Radius,
Diameter, and Center of an Undirected Graph 392
Exercises 396
Appendix 403
Bibliography 415
Index 417
vi
|
| any_adam_object | 1 |
| author | Chachra, Vinod Ghare, Prabhakar M. Moore, James M. |
| author_facet | Chachra, Vinod Ghare, Prabhakar M. Moore, James M. |
| author_role | aut aut aut |
| author_sort | Chachra, Vinod |
| author_variant | v c vc p m g pm pmg j m m jm jmm |
| building | Verbundindex |
| bvnumber | BV002245790 |
| callnumber-first | Q - Science |
| callnumber-label | QA166C44 1979 |
| callnumber-raw | QA166C44 1979 |
| callnumber-search | QA166C44 1979 |
| callnumber-sort | QA 3166 C44 41979 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | QH 400 QH 451 SK 170 SK 890 SK 900 |
| ctrlnum | (OCoLC)728061713 (DE-599)BVBBV002245790 |
| dewey-full | 511.5 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511.5 |
| dewey-search | 511.5 |
| dewey-sort | 3511.5 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik Wirtschaftswissenschaften |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02227nam a2200601 c 4500</leader><controlfield tag="001">BV002245790</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20210609 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">890928s1979 d||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0444002685</subfield><subfield code="9">0-444-00268-5</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)728061713</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV002245790</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="049" ind1=" " ind2=" "><subfield code="a">DE-12</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-473</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-29T</subfield><subfield code="a">DE-19</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-188</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA166C44 1979</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.5</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">QH 400</subfield><subfield code="0">(DE-625)141571:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">QH 451</subfield><subfield code="0">(DE-625)141594:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 170</subfield><subfield code="0">(DE-625)143221:</subfield><subfield code="2">rvk</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">SK 900</subfield><subfield code="0">(DE-625)143268:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">05Cxx</subfield><subfield code="2">msc</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">68E10</subfield><subfield code="2">msc</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Chachra, Vinod</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Applications of graph theory algorithms</subfield><subfield code="c">Vinod Chachra ; Prabhakar M. Ghare ; James M. Moore</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">New York [u.a.]</subfield><subfield code="b">North Holland</subfield><subfield code="c">1979</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">IX, 421 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="650" ind1=" " ind2="4"><subfield code="a">Algorithmes</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Algorithmes</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Graphes, Théorie des</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Théorie des graphes</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="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">Anwendung</subfield><subfield code="0">(DE-588)4196864-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="2"><subfield code="a">Anwendung</subfield><subfield code="0">(DE-588)4196864-5</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">Graphentheorie</subfield><subfield code="0">(DE-588)4113782-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" 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="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Ghare, Prabhakar M.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Moore, James M.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</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=001475889&sequence=000002&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-001475889</subfield></datafield><datafield tag="980" ind1="4" ind2=" "><subfield code="a">(DE-12)AK3940431</subfield></datafield><datafield tag="980" ind1="4" ind2=" "><subfield code="a">(DE-12)AK08020129</subfield></datafield><datafield tag="980" ind1="4" ind2=" "><subfield code="a">(DE-12)AK15260355</subfield></datafield></record></collection> |
| id | DE-604.BV002245790 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T15:42:42Z |
| institution | BVB |
| isbn | 0444002685 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-001475889 |
| oclc_num | 728061713 |
| open_access_boolean | |
| owner | DE-12 DE-384 DE-473 DE-BY-UBG DE-703 DE-739 DE-29T DE-19 DE-BY-UBM DE-706 DE-83 DE-188 |
| owner_facet | DE-12 DE-384 DE-473 DE-BY-UBG DE-703 DE-739 DE-29T DE-19 DE-BY-UBM DE-706 DE-83 DE-188 |
| physical | IX, 421 S. graph. Darst. |
| publishDate | 1979 |
| publishDateSearch | 1979 |
| publishDateSort | 1979 |
| publisher | North Holland |
| record_format | marc |
| spelling | Chachra, Vinod Verfasser aut Applications of graph theory algorithms Vinod Chachra ; Prabhakar M. Ghare ; James M. Moore New York [u.a.] North Holland 1979 IX, 421 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Algorithmes Algorithmes ram Graphes, Théorie des ram Théorie des graphes Algorithmus (DE-588)4001183-5 gnd rswk-swf Graphentheorie (DE-588)4113782-6 gnd rswk-swf Anwendung (DE-588)4196864-5 gnd rswk-swf Graphentheorie (DE-588)4113782-6 s Algorithmus (DE-588)4001183-5 s Anwendung (DE-588)4196864-5 s DE-604 Ghare, Prabhakar M. Verfasser aut Moore, James M. Verfasser aut HBZ Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=001475889&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Chachra, Vinod Ghare, Prabhakar M. Moore, James M. Applications of graph theory algorithms Algorithmes Algorithmes ram Graphes, Théorie des ram Théorie des graphes Algorithmus (DE-588)4001183-5 gnd Graphentheorie (DE-588)4113782-6 gnd Anwendung (DE-588)4196864-5 gnd |
| subject_GND | (DE-588)4001183-5 (DE-588)4113782-6 (DE-588)4196864-5 |
| title | Applications of graph theory algorithms |
| title_auth | Applications of graph theory algorithms |
| title_exact_search | Applications of graph theory algorithms |
| title_full | Applications of graph theory algorithms Vinod Chachra ; Prabhakar M. Ghare ; James M. Moore |
| title_fullStr | Applications of graph theory algorithms Vinod Chachra ; Prabhakar M. Ghare ; James M. Moore |
| title_full_unstemmed | Applications of graph theory algorithms Vinod Chachra ; Prabhakar M. Ghare ; James M. Moore |
| title_short | Applications of graph theory algorithms |
| title_sort | applications of graph theory algorithms |
| topic | Algorithmes Algorithmes ram Graphes, Théorie des ram Théorie des graphes Algorithmus (DE-588)4001183-5 gnd Graphentheorie (DE-588)4113782-6 gnd Anwendung (DE-588)4196864-5 gnd |
| topic_facet | Algorithmes Graphes, Théorie des Théorie des graphes Algorithmus Graphentheorie Anwendung |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=001475889&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT chachravinod applicationsofgraphtheoryalgorithms AT ghareprabhakarm applicationsofgraphtheoryalgorithms AT moorejamesm applicationsofgraphtheoryalgorithms |