Isomorphism Testing for Restricted Graph Classes

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

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

Автор: Fabian Wagner

Език:

Корици: С меки корици

Издател: Sudwestdeutscher Verlag Fur Hochschulschriften AG

Наличност: Външен склад

Изпращаме след 5-8 дни

82.28 € 160.92 лв

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

Информация за книгата

Автор

Fabian Wagner

Език

Английски език

Корици

Книга - С меки корици

Издадена

2010

страници

244

EAN

9783838119540

ISBN

3838119541

Enbook ID

07012021

Издател

Sudwestdeutscher Verlag Fur Hochschulschriften AG

Теглоt

363

Размери

152 x 229 x 14

Пълно описание

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.

Може също да ви хареса

Клиенти, които купиха тази книга, купиха също

Най-често търсени

Categories

Authors

Publishers

Продукти

Продукти

Най-често търсени

Categories

Authors

Publishers

Продукти

Продукти

Isomorphism Testing for Restricted Graph Classes

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

Информация за книгата

Пълно описание

Може също да ви хареса

Клиенти, които купиха тази книга, купиха също