Kontakt
Ako nakupovať
Doručenie
Nákupný poradca
Isomorphism Testing for Restricted Graph Classes
On the complexity of isomorphism testing and reachability problems for restricted graph classes
Angličtina
194 b
Až 30 dní na vrátenie tovaru
Zákazníci tiež kúpili
/
Brožovaná
42.86
€
/
Pevná
178.26
€
/
Pevná
119.38
€
/
Brožovaná
24.11
€
/
Brožovaná
26.04
€
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.
Informácie o knihe
Angličtina
Darujte túto knihu ešte dnes
Je to jednoduché
1 Pridajte knihu do košíka a vyberte možnosť doručiť ako darček 2 Obratom Vám zašleme poukaz 3 Knihu zašleme na adresu obdarovanéhoMohlo by vás tiež zaujímať
/
Brožovaná
20.06
€
/
Brožovaná
16.21
€
/
Brožovaná
12.35
€
/
Brožovaná
8.91
€
/
Brožovaná
17.93
€
/
Brožovaná
19.25
€
Ahoj! Som Libroamiko, tvoj knižný radca.
Ako ti môžem pomôcť?