Isomorphism Testing for Restricted Graph Classes

Name: Isomorphism Testing for Restricted Graph Classes
Brand: Sudwestdeutscher Verlag Fur Hochschulschriften AG
SKU: 9783838119540
Price: 77.62 EUR
Availability: InStock

On the complexity of isomorphism testing and reachability problems for restricted graph classes

Autor: Fabian Wagner

Jazyk:

Väzba: Brožovaná

Vydavateľ: Sudwestdeutscher Verlag Fur Hochschulschriften AG

Dostupnosť: Skladom u dodávateľa

Odosielame za 5-8 dní

77.62 €

The graph isomorphism problem (GI) consists of deciding whether there is a bijection between the ver...

Informácie o knihe

Autor

Fabian Wagner

Jazyk

Angličtina

Väzba

Kniha - Brožovaná

Vydalo

2010

Stránok

244

EAN

9783838119540

ISBN

3838119541

Enbook ID

07012021

Vydavateľ

Sudwestdeutscher Verlag Fur Hochschulschriften AG

Hmotnosť

363

Rozmery

152 x 229 x 14

Kompletný popis

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.

Mohlo by vás zaujímať

Zákazníci, ktorí si kúpili túto knihu, kúpili tiež

Najčastejšie vyhľadávané

Categories

Authors

Publishers

Produkty

Produkty

Najčastejšie vyhľadávané

Categories

Authors

Publishers

Produkty

Produkty

Isomorphism Testing for Restricted Graph Classes

On the complexity of isomorphism testing and reachability problems for restricted graph classes

Informácie o knihe

Kompletný popis

Mohlo by vás zaujímať

Zákazníci, ktorí si kúpili túto knihu, kúpili tiež