Graph theory: modeling, applications, and algorithms
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Upper Saddle River, NJ [u.a.]
Pearson Education Internat.
2007
|
| Ausgabe: | International ed. |
| Schlagworte: | |
| Online-Zugang: | lizenzfrei Inhaltsverzeichnis |
| Beschreibung: | Literaturverz. S. 431 - 433 |
| Beschreibung: | XVII, 446 S. graph. Darst. |
| ISBN: | 0131565362 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV021840141 | ||
| 003 | DE-604 | ||
| 005 | 20080612 | ||
| 007 | t | ||
| 008 | 061205s2007 d||| |||| 00||| eng d | ||
| 020 | |a 0131565362 |c (pbk) |9 0-13-156536-2 | ||
| 035 | |a (OCoLC)255614640 | ||
| 035 | |a (DE-599)BVBBV021840141 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-703 |a DE-634 | ||
| 050 | 0 | |a QA166 | |
| 082 | 0 | |a 511.5 | |
| 084 | |a SK 890 |0 (DE-625)143267: |2 rvk | ||
| 100 | 1 | |a Agnarsson, Geir |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Graph theory |b modeling, applications, and algorithms |c Geir Agnarsson ; Raymond Greenlaw |
| 250 | |a International ed. | ||
| 264 | 1 | |a Upper Saddle River, NJ [u.a.] |b Pearson Education Internat. |c 2007 | |
| 300 | |a XVII, 446 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 500 | |a Literaturverz. S. 431 - 433 | ||
| 650 | 4 | |a Algorithms | |
| 650 | 4 | |a Graph theory | |
| 650 | 0 | 7 | |a Graphentheorie |0 (DE-588)4113782-6 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Graphentheorie |0 (DE-588)4113782-6 |D s |
| 689 | 0 | |5 DE-604 | |
| 700 | 1 | |a Greenlaw, Raymond |e Verfasser |4 aut | |
| 856 | 4 | |u http://www.gbv.de/dms/ilmenau/toc/516826603agnar.PDF |z lizenzfrei |3 Inhaltsverzeichnis | |
| 856 | 4 | 2 | |m GBV Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=015052010&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-015052010 | ||
Datensatz im Suchindex
| _version_ | 1804135774280482816 |
|---|---|
| adam_text | GRAPH THEORY: MODELING, APPLICATIONS, AND ALGORITHMS GEIR AGNARSSON
DEPARTMENT OF MATHEMATICS GEORGE MASON UNIVERSITY RAYMOND GREENLAW
SCHOOL OF COMPUTING ARMSTRONG ATLANTIC STATE UNIVERSITY PEARSON PRENTICE
HALL PEARSON EDUCATION INTERNATIONAL I PREFACE IX 1 INTRODUCTION TO
GRAPH THEORY 1 1.1 INTRODUCTION 1 1.2 WHY STUDY GRAPHS? 1 1.3
MATHEMATICAL PRELIMINARIES 6 1.4 THE DEFINITION OFA GRAPH 10 1.5
EXAMPLES OF COMMON GRAPHS 13 1.6 DEGREES AND REGULAER GRAPHS 15 1.7
SUBGRAPHS 19 1.8 THE DEFINITION OF A DIRECTED GRAPH 21 1.9 INDEGREES AND
OUTDEGREES IN A DIGRAPH 24 1.10 EXERCISES 26 2 BASIC CONCEPTS IN GRAPH
THEORY 31 2.1 PATHS AND CYCLES 31 2.2 CONNECTIVITY 35 2.3 HOMOMORPHISMS
AND TSOMORPHISMS OF GRAPHS 39 2.4 MORE ON ISOMORPHISMS ON SIMPLE GRAPHS
45 2.5 FORMATIONS AND MINORS OF GRAPHS 48 2.6 HOMOMORPHISMS AND
ISOMORPHISMS FOR DIGRAPHS 55 2.7 DIGRAPH CONNECTIVITY 58 2.8 EXERCISES
61 3 TREES AND FORESTS 66 3.1 TREES AND SOMEOFTHEIR BASIC PROPERTIES 66
3.2 CHARACTERIZATIONS OF TREES 70 3.3 INDUETIVE PROOFS ON TREES 71 3.4
ERDOES-SZEKERES THEOREM ON SEQUENCES 74 3.5 CENTERS IN TREES 77 3.6
ROOTED TREES 81 3.7 BINARY TREES 83 3.8 EEVELS IN ROOTED AND BINARY
TREES 88 3.9 EXERCISES 93 VI CONTENTS 4 SPANNING TREES 98 4.1 SPANNING
TREES AND FORESTS 98 4.2 SPANNING TREES OF THE COMPLETE GRAPH 101 4.3
THE ADJACENCY MATRIX OFA GRAPH 104 4.4 THE INCIDENCE MATRIX OFA GRAPH
108 4.5 THE MATRIX-TREE THEOREM 112 4.6 AN APPLICATION TO ELECTRICAL
NETWORKS 117 4.7 MINIMUM COST SPANNING TREES 121 4.8 EXERCISES 126 5
FUNDAMENTAL PROPERTIES OF GRAPHS AND DIGRAPHS 132 5.1 BIPARTITE GRAPHS
132 5.2 EULERIAN GRAPHS 135 5.3 HAMILTONIAN GRAPHS 139 5.4 HAMILTONIAN
CYCLES IN WEIGHTED GRAPHS 144 5.5 EULERIAN AND HAMILTONIAN DIGRAPHS 145
5.6 TOURNAMENT DIGRAPHS 147 5.7 ON THE ADJACENCY MATRIX OFA DIGRAPH 150
5.8 ACYCLIC DIGRAPHS AND POSETS 152 5.9 EXERCISES 155 6 CONNECTIVITY AND
FLOW 160 6.1 EDGECUTS 160 6.2 EDGE CONNECTIVITY AND CONNECTIVITY 163 6.3
BLOCKS IN SEPARABLE GRAPHS 168 6.4 FLOWS IN NETWORKS 173 6.5 THE
THEOREMS OF MENGER 185 6.6 EXERCISES 190 7 PLANAR GRAPHS 195 7.1
EMBEDDINGS IN SURFACES 195 7.2 MORE ON PLANAR EMBEDDINGS 199 7.3 EULER S
FORMULA AND CONSEQUENCES 201 7.4 CHARACTERIZATION OF PLANAR GRAPHS 205
7.5 KURATOWSKI AND WAGNER S THEOREM 210 7.6 PLANE DUALITY 214 7.7 HIGHER
GENUS 220 7.8 GENERALIZATION OF EULER S FORMULA 224 7.9 CROSSING NUMBER
227 7.10 EXERCISES 228 8 GRAPH COLORING 232 8.1 THE CHROMATIC NUMBER OF
A GRAPH 232 8.2 MULTIPARTITE GRAPHS 236 8.3 RESULTS FOR GENERAL GRAPHS
241 8.4 PLANAR GRAPHS AND OTHER SURFACE GRAPHS 245 8.5 EDGE COLORING OF
A GRAPH 252 CONTENTS VUE 8.6 TAIT S THEOREM 257 8.7 EXERCISES 259 9
COLORING ENUMERATIONS AND CHORDAL GRAPHS 267 9. 1 THE CHROMATIC
POLYNOMIAL OF A GRAPH 267 9.2 BASIC PROPERTIES OF THE CHROMATIC
POLYNOMIAL 272 9.3 INTERVAL AND TNTERSECTION GRAPHS 275 9.4 CHORDAL
GRAPHS 284 9.5 POWERS OF GRAPHS 290 9.6 EXERCISES 296 10 INDEPENDENCE,
DOMINANCE, AND MATCHINGS 299 10.1 INDEPENDENCE OF VERTICES 299 10.2
DOMINATION OF VERTICES 305 10.3 MATCHINGS IN A GRAPH 312 10.4 HALL S
MARRIAGE THEOREM 318 10.5 EXERCISES 323 11 COVER PARAMETERS AND MATCHING
POLYNOMIALS 327 1 ] . 1 COVERS AND RELATED PARAMETERS 327 11.2 ROOK
POLYNOMIALS AND BIPARTITE GRAPHS 333 11.3 THE MATCHING DEFECT POLYNOMIAL
340 11.4 MATCHING ALGORITHMS 343 11.5 EXERCISES 351 12 GRAPH COUNTING
356 12.1 TNTRODUCTION 356 1.2.2 BASIC COUNTING RESULTS 358 12.3
GENERATING FUNCTIONS 365 12.4 PARTITIONS OF A FINITE SET 371 12.5 THE
LABCLED COUNTING LEMMA 374 J2.6 THE EXPONENTIAL FORMULA 378 12.7 THE
NUMHER TWO AND RELATED GRAPHS 381 12.7.1 TWO-REGULAR GRAPHS 381 12.7.2
TWO-COLORABLE GRAPHS 382 12.7.3 EVEN GRAPHS 384 12.8 EXERCISES 386 13
GRAPH ALGORITHMS 392 13.1 LNTRODUCTION 392 13.2 RCCAP OF ALGORITHMS
ALREADY PRESENTED 393 13.3 ALGORITHM EFFICIENCY 394 13.4 BREADTH-FIRST
SEARCH 396 13.5 DEPTH-FIRST SEARCH 400 13.6 CONNECTED COMPONENTS 403
13.7 DIJKSTRA S SHORTEST PATH ALGORITHM 407 13.8 JAVA SOURCE CODE 411
13.9 EXERCISES 416 VIII CONTENTS APPENDICES A GREEK ALPHABET 421 B
NOTATION 423 C TOP TEN ONLINE REFERENCES 429 BIBLIOGRAPHY 431 INDEX 435
|
| adam_txt |
GRAPH THEORY: MODELING, APPLICATIONS, AND ALGORITHMS GEIR AGNARSSON
DEPARTMENT OF MATHEMATICS GEORGE MASON UNIVERSITY RAYMOND GREENLAW
SCHOOL OF COMPUTING ARMSTRONG ATLANTIC STATE UNIVERSITY PEARSON PRENTICE
HALL PEARSON EDUCATION INTERNATIONAL I PREFACE IX 1 INTRODUCTION TO
GRAPH THEORY 1 1.1 INTRODUCTION 1 1.2 WHY STUDY GRAPHS? 1 1.3
MATHEMATICAL PRELIMINARIES 6 1.4 THE DEFINITION OFA GRAPH 10 1.5
EXAMPLES OF COMMON GRAPHS 13 1.6 DEGREES AND REGULAER GRAPHS 15 1.7
SUBGRAPHS 19 1.8 THE DEFINITION OF A DIRECTED GRAPH 21 1.9 INDEGREES AND
OUTDEGREES IN A DIGRAPH 24 1.10 EXERCISES 26 2 BASIC CONCEPTS IN GRAPH
THEORY 31 2.1 PATHS AND CYCLES 31 2.2 CONNECTIVITY 35 2.3 HOMOMORPHISMS
AND TSOMORPHISMS OF GRAPHS 39 2.4 MORE ON ISOMORPHISMS ON SIMPLE GRAPHS
45 2.5 FORMATIONS AND MINORS OF GRAPHS 48 2.6 HOMOMORPHISMS AND
ISOMORPHISMS FOR DIGRAPHS 55 2.7 DIGRAPH CONNECTIVITY 58 2.8 EXERCISES
61 3 TREES AND FORESTS 66 3.1 TREES AND SOMEOFTHEIR BASIC PROPERTIES 66
3.2 CHARACTERIZATIONS OF TREES 70 3.3 INDUETIVE PROOFS ON TREES 71 3.4
ERDOES-SZEKERES THEOREM ON SEQUENCES 74 3.5 CENTERS IN TREES 77 3.6
ROOTED TREES 81 3.7 BINARY TREES 83 3.8 EEVELS IN ROOTED AND BINARY
TREES 88 3.9 EXERCISES 93 VI CONTENTS 4 SPANNING TREES 98 4.1 SPANNING
TREES AND FORESTS 98 4.2 SPANNING TREES OF THE COMPLETE GRAPH 101 4.3
THE ADJACENCY MATRIX OFA GRAPH 104 4.4 THE INCIDENCE MATRIX OFA GRAPH
108 4.5 THE MATRIX-TREE THEOREM 112 4.6 AN APPLICATION TO ELECTRICAL
NETWORKS 117 4.7 MINIMUM COST SPANNING TREES 121 4.8 EXERCISES 126 5
FUNDAMENTAL PROPERTIES OF GRAPHS AND DIGRAPHS 132 5.1 BIPARTITE GRAPHS
132 5.2 EULERIAN GRAPHS 135 5.3 HAMILTONIAN GRAPHS 139 5.4 HAMILTONIAN
CYCLES IN WEIGHTED GRAPHS 144 5.5 EULERIAN AND HAMILTONIAN DIGRAPHS 145
5.6 TOURNAMENT DIGRAPHS 147 5.7 ON THE ADJACENCY MATRIX OFA DIGRAPH 150
5.8 ACYCLIC DIGRAPHS AND POSETS 152 5.9 EXERCISES 155 6 CONNECTIVITY AND
FLOW 160 6.1 EDGECUTS 160 6.2 EDGE CONNECTIVITY AND CONNECTIVITY 163 6.3
BLOCKS IN SEPARABLE GRAPHS 168 6.4 FLOWS IN NETWORKS 173 6.5 THE
THEOREMS OF MENGER 185 6.6 EXERCISES 190 7 PLANAR GRAPHS 195 7.1
EMBEDDINGS IN SURFACES 195 7.2 MORE ON PLANAR EMBEDDINGS 199 7.3 EULER'S
FORMULA AND CONSEQUENCES 201 7.4 CHARACTERIZATION OF PLANAR GRAPHS 205
7.5 KURATOWSKI AND WAGNER'S THEOREM 210 7.6 PLANE DUALITY 214 7.7 HIGHER
GENUS 220 7.8 GENERALIZATION OF EULER'S FORMULA 224 7.9 CROSSING NUMBER
227 7.10 EXERCISES 228 8 GRAPH COLORING 232 8.1 THE CHROMATIC NUMBER OF
A GRAPH 232 8.2 MULTIPARTITE GRAPHS 236 8.3 RESULTS FOR GENERAL GRAPHS
241 8.4 PLANAR GRAPHS AND OTHER SURFACE GRAPHS 245 8.5 EDGE COLORING OF
A GRAPH 252 CONTENTS VUE 8.6 TAIT'S THEOREM 257 8.7 EXERCISES 259 9
COLORING ENUMERATIONS AND CHORDAL GRAPHS 267 9. 1 THE CHROMATIC
POLYNOMIAL OF A GRAPH 267 9.2 BASIC PROPERTIES OF THE CHROMATIC
POLYNOMIAL 272 9.3 INTERVAL AND TNTERSECTION GRAPHS 275 9.4 CHORDAL
GRAPHS 284 9.5 POWERS OF GRAPHS 290 9.6 EXERCISES 296 10 INDEPENDENCE,
DOMINANCE, AND MATCHINGS 299 10.1 INDEPENDENCE OF VERTICES 299 10.2
DOMINATION OF VERTICES 305 10.3 MATCHINGS IN A GRAPH 312 10.4 HALL'S
MARRIAGE THEOREM 318 10.5 EXERCISES 323 11 COVER PARAMETERS AND MATCHING
POLYNOMIALS 327 1 ] . 1 COVERS AND RELATED PARAMETERS 327 11.2 ROOK
POLYNOMIALS AND BIPARTITE GRAPHS 333 11.3 THE MATCHING DEFECT POLYNOMIAL
340 11.4 MATCHING ALGORITHMS 343 11.5 EXERCISES 351 12 GRAPH COUNTING
356 12.1 TNTRODUCTION 356 1.2.2 BASIC COUNTING RESULTS 358 12.3
GENERATING FUNCTIONS 365 12.4 PARTITIONS OF A FINITE SET 371 12.5 THE
LABCLED COUNTING LEMMA 374 J2.6 THE EXPONENTIAL FORMULA 378 12.7 THE
NUMHER TWO AND RELATED GRAPHS 381 12.7.1 TWO-REGULAR GRAPHS 381 12.7.2
TWO-COLORABLE GRAPHS 382 12.7.3 EVEN GRAPHS 384 12.8 EXERCISES 386 13
GRAPH ALGORITHMS 392 13.1 LNTRODUCTION 392 13.2 RCCAP OF ALGORITHMS
ALREADY PRESENTED 393 13.3 ALGORITHM EFFICIENCY 394 13.4 BREADTH-FIRST
SEARCH 396 13.5 DEPTH-FIRST SEARCH 400 13.6 CONNECTED COMPONENTS 403
13.7 DIJKSTRA'S SHORTEST PATH ALGORITHM 407 13.8 JAVA SOURCE CODE 411
13.9 EXERCISES 416 VIII CONTENTS APPENDICES A GREEK ALPHABET 421 B
NOTATION 423 C TOP TEN ONLINE REFERENCES 429 BIBLIOGRAPHY 431 INDEX 435 |
| any_adam_object | 1 |
| any_adam_object_boolean | 1 |
| author | Agnarsson, Geir Greenlaw, Raymond |
| author_facet | Agnarsson, Geir Greenlaw, Raymond |
| author_role | aut aut |
| author_sort | Agnarsson, Geir |
| author_variant | g a ga r g rg |
| building | Verbundindex |
| bvnumber | BV021840141 |
| callnumber-first | Q - Science |
| callnumber-label | QA166 |
| callnumber-raw | QA166 |
| callnumber-search | QA166 |
| callnumber-sort | QA 3166 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | SK 890 |
| ctrlnum | (OCoLC)255614640 (DE-599)BVBBV021840141 |
| 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 |
| discipline_str_mv | Mathematik |
| edition | International ed. |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01552nam a2200409 c 4500</leader><controlfield tag="001">BV021840141</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20080612 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">061205s2007 d||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0131565362</subfield><subfield code="c">(pbk)</subfield><subfield code="9">0-13-156536-2</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)255614640</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV021840141</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-703</subfield><subfield code="a">DE-634</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA166</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.5</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="100" ind1="1" ind2=" "><subfield code="a">Agnarsson, Geir</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Graph theory</subfield><subfield code="b">modeling, applications, and algorithms</subfield><subfield code="c">Geir Agnarsson ; Raymond Greenlaw</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">International ed.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Upper Saddle River, NJ [u.a.]</subfield><subfield code="b">Pearson Education Internat.</subfield><subfield code="c">2007</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XVII, 446 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="500" ind1=" " ind2=" "><subfield code="a">Literaturverz. S. 431 - 433</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graph theory</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="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=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Greenlaw, Raymond</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="856" ind1="4" ind2=" "><subfield code="u">http://www.gbv.de/dms/ilmenau/toc/516826603agnar.PDF</subfield><subfield code="z">lizenzfrei</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">GBV 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=015052010&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-015052010</subfield></datafield></record></collection> |
| id | DE-604.BV021840141 |
| illustrated | Illustrated |
| index_date | 2024-07-02T16:00:10Z |
| indexdate | 2024-07-09T20:45:51Z |
| institution | BVB |
| isbn | 0131565362 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-015052010 |
| oclc_num | 255614640 |
| open_access_boolean | |
| owner | DE-703 DE-634 |
| owner_facet | DE-703 DE-634 |
| physical | XVII, 446 S. graph. Darst. |
| publishDate | 2007 |
| publishDateSearch | 2007 |
| publishDateSort | 2007 |
| publisher | Pearson Education Internat. |
| record_format | marc |
| spelling | Agnarsson, Geir Verfasser aut Graph theory modeling, applications, and algorithms Geir Agnarsson ; Raymond Greenlaw International ed. Upper Saddle River, NJ [u.a.] Pearson Education Internat. 2007 XVII, 446 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Literaturverz. S. 431 - 433 Algorithms Graph theory Graphentheorie (DE-588)4113782-6 gnd rswk-swf Graphentheorie (DE-588)4113782-6 s DE-604 Greenlaw, Raymond Verfasser aut http://www.gbv.de/dms/ilmenau/toc/516826603agnar.PDF lizenzfrei Inhaltsverzeichnis GBV Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=015052010&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Agnarsson, Geir Greenlaw, Raymond Graph theory modeling, applications, and algorithms Algorithms Graph theory Graphentheorie (DE-588)4113782-6 gnd |
| subject_GND | (DE-588)4113782-6 |
| title | Graph theory modeling, applications, and algorithms |
| title_auth | Graph theory modeling, applications, and algorithms |
| title_exact_search | Graph theory modeling, applications, and algorithms |
| title_exact_search_txtP | Graph theory modeling, applications, and algorithms |
| title_full | Graph theory modeling, applications, and algorithms Geir Agnarsson ; Raymond Greenlaw |
| title_fullStr | Graph theory modeling, applications, and algorithms Geir Agnarsson ; Raymond Greenlaw |
| title_full_unstemmed | Graph theory modeling, applications, and algorithms Geir Agnarsson ; Raymond Greenlaw |
| title_short | Graph theory |
| title_sort | graph theory modeling applications and algorithms |
| title_sub | modeling, applications, and algorithms |
| topic | Algorithms Graph theory Graphentheorie (DE-588)4113782-6 gnd |
| topic_facet | Algorithms Graph theory Graphentheorie |
| url | http://www.gbv.de/dms/ilmenau/toc/516826603agnar.PDF http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=015052010&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT agnarssongeir graphtheorymodelingapplicationsandalgorithms AT greenlawraymond graphtheorymodelingapplicationsandalgorithms |