Contacto
Cómo comprar
Entrega
Guía de compras
Isomorphism Testing for Restricted Graph Classes
On the complexity of isomorphism testing and reachability problems for restricted graph classes
Inglés
216 b
Política de devolución de 30 días
Clientes que también han comprado
/
Tapa dura
39.99
€
/
Tapa blanda
47.29
€
/
Tapa dura
188.19
€
/
Tapa dura
130.19
€
/
Tapa blanda
28.69
€
/
Tapa blanda
24.19
€
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 el libro
Inglés
Regale este libro hoy
Es fácil
1 Añadir al carrito y elegir Entregar como regalo en el checkout 2 Le enviaremos un vale 3 El libro llegará a la dirección del destinatarioTambién puede interesarle
/
Tapa blanda
18.09
€
/
Tapa blanda
9.69
€
/
Tapa blanda
13.59
€
/
Tapa blanda
21.99
€
/
Tapa blanda
20.99
€
¡Hola! Soy Libroamiko, tu asesor de libros.
¿Cómo puedo ayudarte?