Isomorphism Testing for Restricted Graph Classes

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

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

Szerző: Fabian Wagner

Nyelv:

Kötés: Puha kötésű

Kiadó: Sudwestdeutscher Verlag Fur Hochschulschriften AG

Elérhetőség: Beszállítói készleten

Küldés 5-8 napon belül

30 109 Ft

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

Információk a könyvről

Szerző

Fabian Wagner

Nyelv

Angol

Kötés

Könyv - Puha kötésű

Kiadva

2010

oldal

244

EAN

9783838119540

ISBN

3838119541

Enbook ID

07012021

Kiadó

Sudwestdeutscher Verlag Fur Hochschulschriften AG

Súly

363

Méretek

152 x 229 x 14

Teljes leírás

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.

Érdekelheti

Azok a vásárlók, akik ezt a könyvet megvásárolták, a következőket is megvásárolták

Leggyakrabban keresett

Categories

Authors

Publishers

Termékek

Termékek

Leggyakrabban keresett

Categories

Authors

Publishers

Termékek

Termékek

Isomorphism Testing for Restricted Graph Classes

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

Információk a könyvről

Teljes leírás

Érdekelheti

Azok a vásárlók, akik ezt a könyvet megvásárolták, a következőket is megvásárolták