Algorithmic graph theory:
"This is a textbook on graph theory, especially suitable for computer scientists but also suitable for mathematicians with an interest in computational complexity. Although it introduces most of the classical concepts of pure and applied graph theory (spanning trees, connectivity, genus, colour...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Cambridge u.a.
Cambridge Univ. Pr.
1985
|
| Ausgabe: | 1. publ. |
| Schlagworte: | |
| Zusammenfassung: | "This is a textbook on graph theory, especially suitable for computer scientists but also suitable for mathematicians with an interest in computational complexity. Although it introduces most of the classical concepts of pure and applied graph theory (spanning trees, connectivity, genus, colourability, flows in networks, matchings and traversals) and covers many of the major classical theorems, the emphasis is on algorithms and thier complexity: which graph problems have known efficient solutions and which are intractable. For the intractable problems a number of efficient approximation algorithms are included with known performance bounds. Informal use is made of a PASCAL-like programming language to describe the algorithms. A number of exercises and outlines of solutions are included to extend and motivate the material of the text."-- Book cover. |
| Beschreibung: | XII, 259 S. graph. Darst. |
| ISBN: | 0521246598 0521288819 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV006119172 | ||
| 003 | DE-604 | ||
| 005 | 19961120 | ||
| 007 | t | ||
| 008 | 921030s1985 d||| |||| 00||| eng d | ||
| 020 | |a 0521246598 |9 0-521-24659-8 | ||
| 020 | |a 0521288819 |9 0-521-28881-9 | ||
| 035 | |a (OCoLC)11316168 | ||
| 035 | |a (DE-599)BVBBV006119172 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-703 |a DE-739 | ||
| 050 | 0 | |a QA166 | |
| 082 | 0 | |a 511/.5 |2 19 | |
| 084 | |a QH 451 |0 (DE-625)141594: |2 rvk | ||
| 084 | |a SK 890 |0 (DE-625)143267: |2 rvk | ||
| 100 | 1 | |a Gibbons, Alan |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Algorithmic graph theory |c Alan Gibbons |
| 250 | |a 1. publ. | ||
| 264 | 1 | |a Cambridge u.a. |b Cambridge Univ. Pr. |c 1985 | |
| 300 | |a XII, 259 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 520 | 3 | |a "This is a textbook on graph theory, especially suitable for computer scientists but also suitable for mathematicians with an interest in computational complexity. Although it introduces most of the classical concepts of pure and applied graph theory (spanning trees, connectivity, genus, colourability, flows in networks, matchings and traversals) and covers many of the major classical theorems, the emphasis is on algorithms and thier complexity: which graph problems have known efficient solutions and which are intractable. For the intractable problems a number of efficient approximation algorithms are included with known performance bounds. Informal use is made of a PASCAL-like programming language to describe the algorithms. A number of exercises and outlines of solutions are included to extend and motivate the material of the text."-- Book cover. | |
| 650 | 7 | |a Grafentheorie |2 gtt | |
| 650 | 4 | |a Graphes, Théorie des | |
| 650 | 4 | |a Graphes, Théorie des - Informatique | |
| 650 | 4 | |a Datenverarbeitung | |
| 650 | 4 | |a Graph theory | |
| 650 | 4 | |a Graph theory |x Data processing | |
| 650 | 0 | 7 | |a Graphentheorie |0 (DE-588)4113782-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-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 | |5 DE-604 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-003865701 | ||
Datensatz im Suchindex
| _version_ | 1804120342806921216 |
|---|---|
| any_adam_object | |
| author | Gibbons, Alan |
| author_facet | Gibbons, Alan |
| author_role | aut |
| author_sort | Gibbons, Alan |
| author_variant | a g ag |
| building | Verbundindex |
| bvnumber | BV006119172 |
| callnumber-first | Q - Science |
| callnumber-label | QA166 |
| callnumber-raw | QA166 |
| callnumber-search | QA166 |
| callnumber-sort | QA 3166 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | QH 451 SK 890 |
| ctrlnum | (OCoLC)11316168 (DE-599)BVBBV006119172 |
| 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 15 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik Wirtschaftswissenschaften |
| edition | 1. publ. |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02282nam a2200469 c 4500</leader><controlfield tag="001">BV006119172</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19961120 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">921030s1985 d||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0521246598</subfield><subfield code="9">0-521-24659-8</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0521288819</subfield><subfield code="9">0-521-28881-9</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)11316168</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV006119172</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-703</subfield><subfield code="a">DE-739</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><subfield code="2">19</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 890</subfield><subfield code="0">(DE-625)143267:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Gibbons, Alan</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Algorithmic graph theory</subfield><subfield code="c">Alan Gibbons</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">1. publ.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge u.a.</subfield><subfield code="b">Cambridge Univ. Pr.</subfield><subfield code="c">1985</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XII, 259 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="520" ind1="3" ind2=" "><subfield code="a">"This is a textbook on graph theory, especially suitable for computer scientists but also suitable for mathematicians with an interest in computational complexity. Although it introduces most of the classical concepts of pure and applied graph theory (spanning trees, connectivity, genus, colourability, flows in networks, matchings and traversals) and covers many of the major classical theorems, the emphasis is on algorithms and thier complexity: which graph problems have known efficient solutions and which are intractable. For the intractable problems a number of efficient approximation algorithms are included with known performance bounds. Informal use is made of a PASCAL-like programming language to describe the algorithms. A number of exercises and outlines of solutions are included to extend and motivate the material of the text."-- Book cover.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Grafentheorie</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graphes, Théorie des</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graphes, Théorie des - Informatique</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Datenverarbeitung</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graph theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graph theory</subfield><subfield code="x">Data processing</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">Algorithmus</subfield><subfield code="0">(DE-588)4001183-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=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-003865701</subfield></datafield></record></collection> |
| id | DE-604.BV006119172 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T16:40:34Z |
| institution | BVB |
| isbn | 0521246598 0521288819 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-003865701 |
| oclc_num | 11316168 |
| open_access_boolean | |
| owner | DE-703 DE-739 |
| owner_facet | DE-703 DE-739 |
| physical | XII, 259 S. graph. Darst. |
| publishDate | 1985 |
| publishDateSearch | 1985 |
| publishDateSort | 1985 |
| publisher | Cambridge Univ. Pr. |
| record_format | marc |
| spelling | Gibbons, Alan Verfasser aut Algorithmic graph theory Alan Gibbons 1. publ. Cambridge u.a. Cambridge Univ. Pr. 1985 XII, 259 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier "This is a textbook on graph theory, especially suitable for computer scientists but also suitable for mathematicians with an interest in computational complexity. Although it introduces most of the classical concepts of pure and applied graph theory (spanning trees, connectivity, genus, colourability, flows in networks, matchings and traversals) and covers many of the major classical theorems, the emphasis is on algorithms and thier complexity: which graph problems have known efficient solutions and which are intractable. For the intractable problems a number of efficient approximation algorithms are included with known performance bounds. Informal use is made of a PASCAL-like programming language to describe the algorithms. A number of exercises and outlines of solutions are included to extend and motivate the material of the text."-- Book cover. Grafentheorie gtt Graphes, Théorie des Graphes, Théorie des - Informatique Datenverarbeitung Graph theory Graph theory Data processing Graphentheorie (DE-588)4113782-6 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf Graphentheorie (DE-588)4113782-6 s Algorithmus (DE-588)4001183-5 s DE-604 |
| spellingShingle | Gibbons, Alan Algorithmic graph theory Grafentheorie gtt Graphes, Théorie des Graphes, Théorie des - Informatique Datenverarbeitung Graph theory Graph theory Data processing Graphentheorie (DE-588)4113782-6 gnd Algorithmus (DE-588)4001183-5 gnd |
| subject_GND | (DE-588)4113782-6 (DE-588)4001183-5 |
| title | Algorithmic graph theory |
| title_auth | Algorithmic graph theory |
| title_exact_search | Algorithmic graph theory |
| title_full | Algorithmic graph theory Alan Gibbons |
| title_fullStr | Algorithmic graph theory Alan Gibbons |
| title_full_unstemmed | Algorithmic graph theory Alan Gibbons |
| title_short | Algorithmic graph theory |
| title_sort | algorithmic graph theory |
| topic | Grafentheorie gtt Graphes, Théorie des Graphes, Théorie des - Informatique Datenverarbeitung Graph theory Graph theory Data processing Graphentheorie (DE-588)4113782-6 gnd Algorithmus (DE-588)4001183-5 gnd |
| topic_facet | Grafentheorie Graphes, Théorie des Graphes, Théorie des - Informatique Datenverarbeitung Graph theory Graph theory Data processing Graphentheorie Algorithmus |
| work_keys_str_mv | AT gibbonsalan algorithmicgraphtheory |