Digraphs: Theory, Algorithms and Applications
Gespeichert in:
| Beteilige Person: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | Englisch |
| Veröffentlicht: |
London
Springer London
2002
|
| Schlagwörter: | |
| Links: | https://doi.org/10.1007/978-1-4471-3886-0 |
| Beschreibung: | Graph theory is a very popular area of discrete mathematics with not only numerous theoretical developments, but also countless applications to practical problems. As a research area, graph theory is still relatively young, but it is maturing rapidly with many deep results having been discovered over the last couple of decades. The theory of graphs can be roughly partitioned into two branches: the areas of undirected graphs and directed graphs (digraphs). Even though both areas have numerous important applications, for various reasons, undirected graphs have been studied much more extensively than directed graphs. One of the reasons is that undirected graphs form in a sense a special class of directed graphs (symmetric digraphs) and hence problems that can be formulated for both directed and undirected graphs are often easier for the latter. Another reason is that, unlike for the case of undirected graphs, for which there are several important books covering both classical and recent results, no previous book covers more than a small fraction of the results obtained on digraphs within the last 25 years. Typically, digraphs are considered only in one chapter or by a few elementary results scattered throughout the book. Despite all this, the theory of directed graphs has developed enormously within the last three decades. There is an extensive literature on digraphs (more than 3000 papers). Many of these papers contain, not only interesting theoretical results, but also important algorithms as well as applications |
| Umfang: | 1 Online-Ressource (XXII, 754 p) |
| ISBN: | 9781447138860 9781852336110 |
| DOI: | 10.1007/978-1-4471-3886-0 |
Internformat
MARC
| LEADER | 00000nam a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV042419390 | ||
| 003 | DE-604 | ||
| 005 | 20180105 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 150317s2002 xx o|||| 00||| eng d | ||
| 020 | |a 9781447138860 |c Online |9 978-1-4471-3886-0 | ||
| 020 | |a 9781852336110 |c Print |9 978-1-85233-611-0 | ||
| 024 | 7 | |a 10.1007/978-1-4471-3886-0 |2 doi | |
| 035 | |a (OCoLC)864075653 | ||
| 035 | |a (DE-599)BVBBV042419390 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-384 |a DE-703 |a DE-91 |a DE-634 | ||
| 082 | 0 | |a 511.6 |2 23 | |
| 084 | |a MAT 000 |2 stub | ||
| 100 | 1 | |a Bang-Jensen, Jørgen |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Digraphs |b Theory, Algorithms and Applications |c by Jørgen Bang-Jensen, Gregory Gutin |
| 264 | 1 | |a London |b Springer London |c 2002 | |
| 300 | |a 1 Online-Ressource (XXII, 754 p) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 500 | |a Graph theory is a very popular area of discrete mathematics with not only numerous theoretical developments, but also countless applications to practical problems. As a research area, graph theory is still relatively young, but it is maturing rapidly with many deep results having been discovered over the last couple of decades. The theory of graphs can be roughly partitioned into two branches: the areas of undirected graphs and directed graphs (digraphs). Even though both areas have numerous important applications, for various reasons, undirected graphs have been studied much more extensively than directed graphs. One of the reasons is that undirected graphs form in a sense a special class of directed graphs (symmetric digraphs) and hence problems that can be formulated for both directed and undirected graphs are often easier for the latter. Another reason is that, unlike for the case of undirected graphs, for which there are several important books covering both classical and recent results, no previous book covers more than a small fraction of the results obtained on digraphs within the last 25 years. Typically, digraphs are considered only in one chapter or by a few elementary results scattered throughout the book. Despite all this, the theory of directed graphs has developed enormously within the last three decades. There is an extensive literature on digraphs (more than 3000 papers). Many of these papers contain, not only interesting theoretical results, but also important algorithms as well as applications | ||
| 650 | 4 | |a Mathematics | |
| 650 | 4 | |a Computer software | |
| 650 | 4 | |a Algorithms | |
| 650 | 4 | |a Combinatorics | |
| 650 | 4 | |a Mathematical optimization | |
| 650 | 4 | |a Optimization | |
| 650 | 4 | |a Calculus of Variations and Optimal Control; Optimization | |
| 650 | 4 | |a Algorithm Analysis and Problem Complexity | |
| 650 | 4 | |a Mathematik | |
| 650 | 0 | 7 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Digraph |0 (DE-588)4012307-8 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Gerichteter Graph |0 (DE-588)4156815-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Graphentheorie |0 (DE-588)4113782-6 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Gerichteter Graph |0 (DE-588)4156815-1 |D s |
| 689 | 0 | 1 | |a Graphentheorie |0 (DE-588)4113782-6 |D s |
| 689 | 0 | 2 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |D s |
| 689 | 0 | |8 1\p |5 DE-604 | |
| 689 | 1 | 0 | |a Digraph |0 (DE-588)4012307-8 |D s |
| 689 | 1 | |8 2\p |5 DE-604 | |
| 700 | 1 | |a Gutin, Gregory |e Sonstige |4 oth | |
| 856 | 4 | 0 | |u https://doi.org/10.1007/978-1-4471-3886-0 |x Verlag |3 Volltext |
| 912 | |a ZDB-2-SMA | ||
| 912 | |a ZDB-2-BAE | ||
| 940 | 1 | |q ZDB-2-SMA_Archive | |
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 2\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-027854807 | |
Datensatz im Suchindex
| DE-BY-TUM_katkey | 2066399 |
|---|---|
| _version_ | 1821931182060732416 |
| any_adam_object | |
| author | Bang-Jensen, Jørgen |
| author_facet | Bang-Jensen, Jørgen |
| author_role | aut |
| author_sort | Bang-Jensen, Jørgen |
| author_variant | j b j jbj |
| building | Verbundindex |
| bvnumber | BV042419390 |
| classification_tum | MAT 000 |
| collection | ZDB-2-SMA ZDB-2-BAE |
| ctrlnum | (OCoLC)864075653 (DE-599)BVBBV042419390 |
| dewey-full | 511.6 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511.6 |
| dewey-search | 511.6 |
| dewey-sort | 3511.6 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| doi_str_mv | 10.1007/978-1-4471-3886-0 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03773nam a2200625zc 4500</leader><controlfield tag="001">BV042419390</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20180105 </controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">150317s2002 xx o|||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781447138860</subfield><subfield code="c">Online</subfield><subfield code="9">978-1-4471-3886-0</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781852336110</subfield><subfield code="c">Print</subfield><subfield code="9">978-1-85233-611-0</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-1-4471-3886-0</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)864075653</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV042419390</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-384</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-91</subfield><subfield code="a">DE-634</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.6</subfield><subfield code="2">23</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 000</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Bang-Jensen, Jørgen</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Digraphs</subfield><subfield code="b">Theory, Algorithms and Applications</subfield><subfield code="c">by Jørgen Bang-Jensen, Gregory Gutin</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">London</subfield><subfield code="b">Springer London</subfield><subfield code="c">2002</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (XXII, 754 p)</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">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Graph theory is a very popular area of discrete mathematics with not only numerous theoretical developments, but also countless applications to practical problems. As a research area, graph theory is still relatively young, but it is maturing rapidly with many deep results having been discovered over the last couple of decades. The theory of graphs can be roughly partitioned into two branches: the areas of undirected graphs and directed graphs (digraphs). Even though both areas have numerous important applications, for various reasons, undirected graphs have been studied much more extensively than directed graphs. One of the reasons is that undirected graphs form in a sense a special class of directed graphs (symmetric digraphs) and hence problems that can be formulated for both directed and undirected graphs are often easier for the latter. Another reason is that, unlike for the case of undirected graphs, for which there are several important books covering both classical and recent results, no previous book covers more than a small fraction of the results obtained on digraphs within the last 25 years. Typically, digraphs are considered only in one chapter or by a few elementary results scattered throughout the book. Despite all this, the theory of directed graphs has developed enormously within the last three decades. There is an extensive literature on digraphs (more than 3000 papers). Many of these papers contain, not only interesting theoretical results, but also important algorithms as well as applications</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer software</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Combinatorics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematical optimization</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Optimization</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Calculus of Variations and Optimal Control; Optimization</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithm Analysis and Problem Complexity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematik</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Komplexitätstheorie</subfield><subfield code="0">(DE-588)4120591-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Digraph</subfield><subfield code="0">(DE-588)4012307-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Gerichteter Graph</subfield><subfield code="0">(DE-588)4156815-1</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="689" ind1="0" ind2="0"><subfield code="a">Gerichteter Graph</subfield><subfield code="0">(DE-588)4156815-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><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="2"><subfield code="a">Komplexitätstheorie</subfield><subfield code="0">(DE-588)4120591-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Digraph</subfield><subfield code="0">(DE-588)4012307-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="8">2\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Gutin, Gregory</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-1-4471-3886-0</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-SMA</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-BAE</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">ZDB-2-SMA_Archive</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">2\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-027854807</subfield></datafield></record></collection> |
| id | DE-604.BV042419390 |
| illustrated | Not Illustrated |
| indexdate | 2024-12-20T17:10:40Z |
| institution | BVB |
| isbn | 9781447138860 9781852336110 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-027854807 |
| oclc_num | 864075653 |
| open_access_boolean | |
| owner | DE-384 DE-703 DE-91 DE-BY-TUM DE-634 |
| owner_facet | DE-384 DE-703 DE-91 DE-BY-TUM DE-634 |
| physical | 1 Online-Ressource (XXII, 754 p) |
| psigel | ZDB-2-SMA ZDB-2-BAE ZDB-2-SMA_Archive |
| publishDate | 2002 |
| publishDateSearch | 2002 |
| publishDateSort | 2002 |
| publisher | Springer London |
| record_format | marc |
| spellingShingle | Bang-Jensen, Jørgen Digraphs Theory, Algorithms and Applications Mathematics Computer software Algorithms Combinatorics Mathematical optimization Optimization Calculus of Variations and Optimal Control; Optimization Algorithm Analysis and Problem Complexity Mathematik Komplexitätstheorie (DE-588)4120591-1 gnd Digraph (DE-588)4012307-8 gnd Gerichteter Graph (DE-588)4156815-1 gnd Graphentheorie (DE-588)4113782-6 gnd |
| subject_GND | (DE-588)4120591-1 (DE-588)4012307-8 (DE-588)4156815-1 (DE-588)4113782-6 |
| title | Digraphs Theory, Algorithms and Applications |
| title_auth | Digraphs Theory, Algorithms and Applications |
| title_exact_search | Digraphs Theory, Algorithms and Applications |
| title_full | Digraphs Theory, Algorithms and Applications by Jørgen Bang-Jensen, Gregory Gutin |
| title_fullStr | Digraphs Theory, Algorithms and Applications by Jørgen Bang-Jensen, Gregory Gutin |
| title_full_unstemmed | Digraphs Theory, Algorithms and Applications by Jørgen Bang-Jensen, Gregory Gutin |
| title_short | Digraphs |
| title_sort | digraphs theory algorithms and applications |
| title_sub | Theory, Algorithms and Applications |
| topic | Mathematics Computer software Algorithms Combinatorics Mathematical optimization Optimization Calculus of Variations and Optimal Control; Optimization Algorithm Analysis and Problem Complexity Mathematik Komplexitätstheorie (DE-588)4120591-1 gnd Digraph (DE-588)4012307-8 gnd Gerichteter Graph (DE-588)4156815-1 gnd Graphentheorie (DE-588)4113782-6 gnd |
| topic_facet | Mathematics Computer software Algorithms Combinatorics Mathematical optimization Optimization Calculus of Variations and Optimal Control; Optimization Algorithm Analysis and Problem Complexity Mathematik Komplexitätstheorie Digraph Gerichteter Graph Graphentheorie |
| url | https://doi.org/10.1007/978-1-4471-3886-0 |
| work_keys_str_mv | AT bangjensenjørgen digraphstheoryalgorithmsandapplications AT gutingregory digraphstheoryalgorithmsandapplications |