Kontakt
Jak kupować
Dostawa
Doradca ds. zakupów
Isomorphism Testing for Restricted Graph Classes
On the complexity of isomorphism testing and reachability problems for restricted graph classes
Angielski
194 b
30 dni na zwrot towaru
Klienci kupili także
/
Twarda
154.42
zł
/
Twarda
753.39
zł
/
Twarda
504.80
zł
/
Miękka
110.10
zł
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.
Informacje o książce
Angielski
Podaruj tę książkę jeszcze dziś
To łatwe
1 Dodaj książkę do koszyka i wybierz „dostarczyć jako prezent” 2 W odpowiedzi wyślemy Ci bon 3 Książka dotrze na adres obdarowanegoMogłoby Cię także zainteresować
/
Miękka
73.19
zł
/
Miękka
39.50
zł
/
Miękka
55.34
zł
/
Miękka
89.64
zł
/
Miękka
85.63
zł
Cześć! Jestem Libroamiko, Twój doradca książkowy.
Jak mogę Ci pomóc?