Contatto
Come acquistare
Consegna
Guida all'acquisto
Isomorphism Testing for Restricted Graph Classes
On the complexity of isomorphism testing and reachability problems for restricted graph classes
Inglese
171 b
Fino a 30 giorni per il reso
I clienti hanno acquistato anche
/
In brossura
20.29
€
/
Rigido
105.49
€
/
Rigido
149.39
€
/
In brossura
37.29
€
/
In brossura
22.69
€
/
In brossura
19.49
€
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.
Informazioni sul libro
Inglese
Regala questo libro oggi stesso
È facile
1 Aggiungi il libro al carrello e scegli la consegna come regalo 2 Ti invieremo subito il buono 3 Il libro arriverà all'indirizzo del destinatarioPotrebbe interessarti anche
/
In brossura
13.89
€
/
In brossura
10.89
€
/
In brossura
7.79
€
/
In brossura
17.69
€
/
In brossura
20.99
€
/
Calendario
7.59
€
/
In brossura
15.39
€
/
In brossura
37.29
€
Ciao! Sono Libroamiko, il tuo consulente di libri.
Come posso aiutarti?