The graph isomorphism problem: its structural complexity
"The graph isomorphism problem belongs to the part of Complexity Theory that focuses on the structure of complexity classes involved in the classification of computational problems and in the relations among them. It consists in deciding whether two given graphs are isomorphic, i.e. whether the...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Boston u.a.
Birkhäuser
1993
|
| Schriftenreihe: | Progress in theoretical computer science
|
| Schlagworte: | |
| Zusammenfassung: | "The graph isomorphism problem belongs to the part of Complexity Theory that focuses on the structure of complexity classes involved in the classification of computational problems and in the relations among them. It consists in deciding whether two given graphs are isomorphic, i.e. whether there is a bijective mapping from the nodes of one graph to the nodes of the second graph such that the edge connections are respected. It is a problem of considerable practical as wen as theoretical importance that is, as of now, unresolved in the sense that no efficient algorithm for it has yet been found. Given this fact, it is natural to ask whether such an algorithm exists at an or whether the problem is intractable. -Be book focuses on this issue and presents several recent results that provide a better understanding of the relative position of the graph isomorphism problem in the class NP as well as in other complexity classes. It also uses the problem to illustrate important concepts in structural complexity, providing a look into the more general theory. 'The book is basically self-contained; the only prerequisite for reading it is some elementary knowledge from Complexity Theory and Probability Theory. Its level of presentation makes it eminently suitable for a seminar or graduate course devoted to the problem, or as a rich source of examples for a standard graduate course in Complexity Theory." -- Book cover. |
| Beschreibung: | 160 S. graph. Darst. |
| ISBN: | 0817636803 3764336803 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV008151489 | ||
| 003 | DE-604 | ||
| 005 | 19940204 | ||
| 007 | t | ||
| 008 | 930802s1993 d||| |||| 00||| eng d | ||
| 020 | |a 0817636803 |9 0-8176-3680-3 | ||
| 020 | |a 3764336803 |9 3-7643-3680-3 | ||
| 035 | |a (OCoLC)27432721 | ||
| 035 | |a (DE-599)BVBBV008151489 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-20 |a DE-91G |a DE-739 |a DE-29T |a DE-384 |a DE-11 | ||
| 050 | 0 | |a QA267.7 | |
| 082 | 0 | |a 511/.5 |2 20 | |
| 084 | |a SK 890 |0 (DE-625)143267: |2 rvk | ||
| 084 | |a ST 130 |0 (DE-625)143588: |2 rvk | ||
| 084 | |a ST 132 |0 (DE-625)143589: |2 rvk | ||
| 084 | |a MAT 055f |2 stub | ||
| 084 | |a DAT 517f |2 stub | ||
| 100 | 1 | |a Köbler, Johannes |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a The graph isomorphism problem |b its structural complexity |c Johannes Köbler ; Uwe Schöning ; Jacobo Torán |
| 264 | 1 | |a Boston u.a. |b Birkhäuser |c 1993 | |
| 300 | |a 160 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 0 | |a Progress in theoretical computer science | |
| 520 | 3 | |a "The graph isomorphism problem belongs to the part of Complexity Theory that focuses on the structure of complexity classes involved in the classification of computational problems and in the relations among them. It consists in deciding whether two given graphs are isomorphic, i.e. whether there is a bijective mapping from the nodes of one graph to the nodes of the second graph such that the edge connections are respected. It is a problem of considerable practical as wen as theoretical importance that is, as of now, unresolved in the sense that no efficient algorithm for it has yet been found. Given this fact, it is natural to ask whether such an algorithm exists at an or whether the problem is intractable. -Be book focuses on this issue and presents several recent results that provide a better understanding of the relative position of the graph isomorphism problem in the class NP as well as in other complexity classes. It also uses the problem to illustrate important concepts in structural complexity, providing a look into the more general theory. 'The book is basically self-contained; the only prerequisite for reading it is some elementary knowledge from Complexity Theory and Probability Theory. Its level of presentation makes it eminently suitable for a seminar or graduate course devoted to the problem, or as a rich source of examples for a standard graduate course in Complexity Theory." -- Book cover. | |
| 650 | 4 | |a Complexité de calcul (Informatique) | |
| 650 | 7 | |a Complexité de calcul (informatique) |2 ram | |
| 650 | 4 | |a Graphes, Théorie des - Informatique | |
| 650 | 7 | |a Graphes, Théorie des |2 ram | |
| 650 | 4 | |a Isomorphismes (Mathématiques) | |
| 650 | 7 | |a Isomorphismes (mathématiques) |2 ram | |
| 650 | 4 | |a Datenverarbeitung | |
| 650 | 4 | |a Computational complexity | |
| 650 | 4 | |a Graph theory |x Data processing | |
| 650 | 4 | |a Isomorphisms (Mathematics) | |
| 650 | 0 | 7 | |a Graphentheorie |0 (DE-588)4113782-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Isomorphismus |0 (DE-588)4143978-8 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Graph |0 (DE-588)4021842-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Computerunterstütztes Verfahren |0 (DE-588)4139030-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Strukturkomplexität |0 (DE-588)4197555-8 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Graphentheorie |0 (DE-588)4113782-6 |D s |
| 689 | 0 | 1 | |a Computerunterstütztes Verfahren |0 (DE-588)4139030-1 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Isomorphismus |0 (DE-588)4143978-8 |D s |
| 689 | 1 | |5 DE-604 | |
| 689 | 2 | 0 | |a Graph |0 (DE-588)4021842-9 |D s |
| 689 | 2 | 1 | |a Isomorphismus |0 (DE-588)4143978-8 |D s |
| 689 | 2 | 2 | |a Strukturkomplexität |0 (DE-588)4197555-8 |D s |
| 689 | 2 | |5 DE-604 | |
| 689 | 3 | 0 | |a Isomorphismus |0 (DE-588)4143978-8 |D s |
| 689 | 3 | 1 | |a Graph |0 (DE-588)4021842-9 |D s |
| 689 | 3 | |5 DE-604 | |
| 700 | 1 | |a Schöning, Uwe |d 1955- |e Verfasser |0 (DE-588)110028740 |4 aut | |
| 700 | 1 | |a Torán, Jacobo |e Verfasser |4 aut | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005378957 | ||
Datensatz im Suchindex
| _version_ | 1804122534912720896 |
|---|---|
| any_adam_object | |
| author | Köbler, Johannes Schöning, Uwe 1955- Torán, Jacobo |
| author_GND | (DE-588)110028740 |
| author_facet | Köbler, Johannes Schöning, Uwe 1955- Torán, Jacobo |
| author_role | aut aut aut |
| author_sort | Köbler, Johannes |
| author_variant | j k jk u s us j t jt |
| building | Verbundindex |
| bvnumber | BV008151489 |
| callnumber-first | Q - Science |
| callnumber-label | QA267 |
| callnumber-raw | QA267.7 |
| callnumber-search | QA267.7 |
| callnumber-sort | QA 3267.7 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | SK 890 ST 130 ST 132 |
| classification_tum | MAT 055f DAT 517f |
| ctrlnum | (OCoLC)27432721 (DE-599)BVBBV008151489 |
| 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 | Informatik Mathematik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>04042nam a2200721 c 4500</leader><controlfield tag="001">BV008151489</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19940204 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">930802s1993 d||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0817636803</subfield><subfield code="9">0-8176-3680-3</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3764336803</subfield><subfield code="9">3-7643-3680-3</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)27432721</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV008151489</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-20</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-29T</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-11</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA267.7</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511/.5</subfield><subfield code="2">20</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">ST 132</subfield><subfield code="0">(DE-625)143589:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 055f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 517f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Köbler, Johannes</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">The graph isomorphism problem</subfield><subfield code="b">its structural complexity</subfield><subfield code="c">Johannes Köbler ; Uwe Schöning ; Jacobo Torán</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Boston u.a.</subfield><subfield code="b">Birkhäuser</subfield><subfield code="c">1993</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">160 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="490" ind1="0" ind2=" "><subfield code="a">Progress in theoretical computer science</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">"The graph isomorphism problem belongs to the part of Complexity Theory that focuses on the structure of complexity classes involved in the classification of computational problems and in the relations among them. It consists in deciding whether two given graphs are isomorphic, i.e. whether there is a bijective mapping from the nodes of one graph to the nodes of the second graph such that the edge connections are respected. It is a problem of considerable practical as wen as theoretical importance that is, as of now, unresolved in the sense that no efficient algorithm for it has yet been found. Given this fact, it is natural to ask whether such an algorithm exists at an or whether the problem is intractable. -Be book focuses on this issue and presents several recent results that provide a better understanding of the relative position of the graph isomorphism problem in the class NP as well as in other complexity classes. It also uses the problem to illustrate important concepts in structural complexity, providing a look into the more general theory. 'The book is basically self-contained; the only prerequisite for reading it is some elementary knowledge from Complexity Theory and Probability Theory. Its level of presentation makes it eminently suitable for a seminar or graduate course devoted to the problem, or as a rich source of examples for a standard graduate course in Complexity Theory." -- Book cover.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Complexité de calcul (Informatique)</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Complexité de calcul (informatique)</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graphes, Théorie des - Informatique</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">Isomorphismes (Mathématiques)</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Isomorphismes (mathématiques)</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Datenverarbeitung</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational complexity</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=" " ind2="4"><subfield code="a">Isomorphisms (Mathematics)</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">Isomorphismus</subfield><subfield code="0">(DE-588)4143978-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Graph</subfield><subfield code="0">(DE-588)4021842-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Computerunterstütztes Verfahren</subfield><subfield code="0">(DE-588)4139030-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Strukturkomplexität</subfield><subfield code="0">(DE-588)4197555-8</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">Computerunterstütztes Verfahren</subfield><subfield code="0">(DE-588)4139030-1</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">Isomorphismus</subfield><subfield code="0">(DE-588)4143978-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" ind2="0"><subfield code="a">Graph</subfield><subfield code="0">(DE-588)4021842-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2="1"><subfield code="a">Isomorphismus</subfield><subfield code="0">(DE-588)4143978-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2="2"><subfield code="a">Strukturkomplexität</subfield><subfield code="0">(DE-588)4197555-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="3" ind2="0"><subfield code="a">Isomorphismus</subfield><subfield code="0">(DE-588)4143978-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="3" ind2="1"><subfield code="a">Graph</subfield><subfield code="0">(DE-588)4021842-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="3" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Schöning, Uwe</subfield><subfield code="d">1955-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)110028740</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Torán, Jacobo</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005378957</subfield></datafield></record></collection> |
| id | DE-604.BV008151489 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T17:15:25Z |
| institution | BVB |
| isbn | 0817636803 3764336803 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005378957 |
| oclc_num | 27432721 |
| open_access_boolean | |
| owner | DE-20 DE-91G DE-BY-TUM DE-739 DE-29T DE-384 DE-11 |
| owner_facet | DE-20 DE-91G DE-BY-TUM DE-739 DE-29T DE-384 DE-11 |
| physical | 160 S. graph. Darst. |
| publishDate | 1993 |
| publishDateSearch | 1993 |
| publishDateSort | 1993 |
| publisher | Birkhäuser |
| record_format | marc |
| series2 | Progress in theoretical computer science |
| spelling | Köbler, Johannes Verfasser aut The graph isomorphism problem its structural complexity Johannes Köbler ; Uwe Schöning ; Jacobo Torán Boston u.a. Birkhäuser 1993 160 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Progress in theoretical computer science "The graph isomorphism problem belongs to the part of Complexity Theory that focuses on the structure of complexity classes involved in the classification of computational problems and in the relations among them. It consists in deciding whether two given graphs are isomorphic, i.e. whether there is a bijective mapping from the nodes of one graph to the nodes of the second graph such that the edge connections are respected. It is a problem of considerable practical as wen as theoretical importance that is, as of now, unresolved in the sense that no efficient algorithm for it has yet been found. Given this fact, it is natural to ask whether such an algorithm exists at an or whether the problem is intractable. -Be book focuses on this issue and presents several recent results that provide a better understanding of the relative position of the graph isomorphism problem in the class NP as well as in other complexity classes. It also uses the problem to illustrate important concepts in structural complexity, providing a look into the more general theory. 'The book is basically self-contained; the only prerequisite for reading it is some elementary knowledge from Complexity Theory and Probability Theory. Its level of presentation makes it eminently suitable for a seminar or graduate course devoted to the problem, or as a rich source of examples for a standard graduate course in Complexity Theory." -- Book cover. Complexité de calcul (Informatique) Complexité de calcul (informatique) ram Graphes, Théorie des - Informatique Graphes, Théorie des ram Isomorphismes (Mathématiques) Isomorphismes (mathématiques) ram Datenverarbeitung Computational complexity Graph theory Data processing Isomorphisms (Mathematics) Graphentheorie (DE-588)4113782-6 gnd rswk-swf Isomorphismus (DE-588)4143978-8 gnd rswk-swf Graph (DE-588)4021842-9 gnd rswk-swf Computerunterstütztes Verfahren (DE-588)4139030-1 gnd rswk-swf Strukturkomplexität (DE-588)4197555-8 gnd rswk-swf Graphentheorie (DE-588)4113782-6 s Computerunterstütztes Verfahren (DE-588)4139030-1 s DE-604 Isomorphismus (DE-588)4143978-8 s Graph (DE-588)4021842-9 s Strukturkomplexität (DE-588)4197555-8 s Schöning, Uwe 1955- Verfasser (DE-588)110028740 aut Torán, Jacobo Verfasser aut |
| spellingShingle | Köbler, Johannes Schöning, Uwe 1955- Torán, Jacobo The graph isomorphism problem its structural complexity Complexité de calcul (Informatique) Complexité de calcul (informatique) ram Graphes, Théorie des - Informatique Graphes, Théorie des ram Isomorphismes (Mathématiques) Isomorphismes (mathématiques) ram Datenverarbeitung Computational complexity Graph theory Data processing Isomorphisms (Mathematics) Graphentheorie (DE-588)4113782-6 gnd Isomorphismus (DE-588)4143978-8 gnd Graph (DE-588)4021842-9 gnd Computerunterstütztes Verfahren (DE-588)4139030-1 gnd Strukturkomplexität (DE-588)4197555-8 gnd |
| subject_GND | (DE-588)4113782-6 (DE-588)4143978-8 (DE-588)4021842-9 (DE-588)4139030-1 (DE-588)4197555-8 |
| title | The graph isomorphism problem its structural complexity |
| title_auth | The graph isomorphism problem its structural complexity |
| title_exact_search | The graph isomorphism problem its structural complexity |
| title_full | The graph isomorphism problem its structural complexity Johannes Köbler ; Uwe Schöning ; Jacobo Torán |
| title_fullStr | The graph isomorphism problem its structural complexity Johannes Köbler ; Uwe Schöning ; Jacobo Torán |
| title_full_unstemmed | The graph isomorphism problem its structural complexity Johannes Köbler ; Uwe Schöning ; Jacobo Torán |
| title_short | The graph isomorphism problem |
| title_sort | the graph isomorphism problem its structural complexity |
| title_sub | its structural complexity |
| topic | Complexité de calcul (Informatique) Complexité de calcul (informatique) ram Graphes, Théorie des - Informatique Graphes, Théorie des ram Isomorphismes (Mathématiques) Isomorphismes (mathématiques) ram Datenverarbeitung Computational complexity Graph theory Data processing Isomorphisms (Mathematics) Graphentheorie (DE-588)4113782-6 gnd Isomorphismus (DE-588)4143978-8 gnd Graph (DE-588)4021842-9 gnd Computerunterstütztes Verfahren (DE-588)4139030-1 gnd Strukturkomplexität (DE-588)4197555-8 gnd |
| topic_facet | Complexité de calcul (Informatique) Complexité de calcul (informatique) Graphes, Théorie des - Informatique Graphes, Théorie des Isomorphismes (Mathématiques) Isomorphismes (mathématiques) Datenverarbeitung Computational complexity Graph theory Data processing Isomorphisms (Mathematics) Graphentheorie Isomorphismus Graph Computerunterstütztes Verfahren Strukturkomplexität |
| work_keys_str_mv | AT koblerjohannes thegraphisomorphismproblemitsstructuralcomplexity AT schoninguwe thegraphisomorphismproblemitsstructuralcomplexity AT toranjacobo thegraphisomorphismproblemitsstructuralcomplexity |