Isomorphism Testing for Restricted Graph Classes | On the complexity of isomorphism testing and reachability problems for restricted graph classes

Fabian Wagner

ISBN 10: 3838119541 / ISBN 13: 9783838119540

Published by Südwestdeutscher Verlag für Hochschulschriften, 2015

About this Item

Isomorphism Testing for Restricted Graph Classes | On the complexity of isomorphism testing and reachability problems for restricted graph classes | Fabian Wagner | Taschenbuch | 244 S. | Englisch | 2015 | Südwestdeutscher Verlag für Hochschulschriften | EAN 9783838119540 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu.

Seller Inventory # 107349408

Bibliographic Details

• Title: Isomorphism Testing for Restricted Graph Classes | On the complexity of isomorphism testing and reachability problems for restricted graph classes
• Publisher: Südwestdeutscher Verlag für Hochschulschriften
• Publication Date: 2015
• Language: English
• ISBN 10: 3838119541
• ISBN 13: 9783838119540
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 220W x 150H x 16D millimeters 220 millimeters width by 150 millimeters height by 16 millimeters depth
• Weight: 381 grams
• Seller catalogs:
  • Bücher

About this title

Synopsis

The graph isomorphism problem (GI) consists of deciding whether there is a bijection between the vertices of two graphs, which preserves the adjacency relations. GI is not known to be NP-complete nor to be in P. The enormous gap between the known upper and lower bound has motivated a study of isomorphism restricted to special classes of graphs where this gap can be reduced. We prove for the classes of planar graphs, K_{3,3}-minor free and K_5-minor free graphs, that isomorphism testing is in logspace. For graphs of bounded treewidth we prove a new upper bound LogCFL. We also consider the complexity of the isomorphism problem when groups or quasigroups are given in table representation. Because of all these results in the context of logarithmic space complexity classes we also consider reachability problems. Reachability is a widely studied problem especially in the space setting, it asks in a directed graph with two designated vertices s and t whether there is a path from s to t. We improve some upper bounds of the reachability problems for the mentioned graph classes.

About the Author

Fabian Wagner studied computer science at University of Ulm, he received his doctorate in 2010 from Institute of Theoretical Computer Science in Ulm.