Isomorphism Testing for Restricted Graph Classes

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

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

Autor: Fabian Wagner

Jazyk:

Vazba: Brožovaná

Vydavatel: Sudwestdeutscher Verlag Fur Hochschulschriften AG

Dostupnost: Skladem u dodavatele

Odesíláme za 5-8 dnů

1 768 Kč

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

Informace o knize

Autor

Fabian Wagner

Jazyk

Angličtina

Vazba

Kniha - Brožovaná

Vydáno

2010

Stránek

244

EAN

9783838119540

ISBN

3838119541

Enbook ID

07012021

Vydavatel

Sudwestdeutscher Verlag Fur Hochschulschriften AG

Hmotnost

363

Rozměry

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 zajímat

Zákaznicí kteří koupili tuto knihu koupili také

Nejčastěji hledané

Categories

Authors

Publishers

Produkty

Produkty

Nejčastěji hledané

Categories

Authors

Publishers

Produkty

Produkty

Isomorphism Testing for Restricted Graph Classes

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

Informace o knize

Kompletní popis

Mohlo by vás zajímat

Zákaznicí kteří koupili tuto knihu koupili také