Contacto
Como comprar
Entrega
Guia de compras
Isomorphism Testing for Restricted Graph Classes
On the complexity of isomorphism testing and reachability problems for restricted graph classes
Inglês
171 b
Política de devolução de 30 dias
Os clientes também compraram
/
Livro de capa dura
32.50
€
/
Capa mole
37.77
€
/
Livro de capa dura
151.41
€
/
Livro de capa dura
106.84
€
/
Capa mole
22.98
€
/
Capa mole
19.94
€
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.
Sobre o livro
Inglês
Ofereça este livro hoje
É fácil
1 Adicione ao carrinho e escolha Entregar como presente ao finalizar a compra 2 Receberá um vale 3 O livro chegará ao endereço do destinatárioTambém pode estar interessado em
/
Capa mole
14.07
€
/
Capa mole
7.89
€
/
Capa mole
11.03
€
/
Capa mole
17.92
€
/
Livro de capa dura
12.85
€
/
Capa mole
17.11
€
Olá! Sou o Libroamiko, o seu conselheiro de livros.
Como posso ajudar?