Contact
Hoe winkelen bij ons werkt
Bezorging
Winkelgids
Isomorphism Testing for Restricted Graph Classes
On the complexity of isomorphism testing and reachability problems for restricted graph classes
Engels
193 b
Tot 30 dagen retourrecht
Klanten kochten ook
/
Paperback
24.16
€
/
Paperback
42.59
€
/
Paperback
34.84
€
/
Gebonden
185.72
€
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.
Informatie over het boek
Engels
Geef dit boek vandaag nog cadeau
Dat gaat heel eenvoudig
1 Voeg het boek toe aan je winkelwagentje en selecteer Als cadeau bezorgen 2 Je krijgt van ons per omgaand een voucher 3 Het boek wordt bezorgd op het adres van de ontvangerDit vind je misschien ook interessant
/
Paperback
13.28
€
/
Paperback
21.64
€
/
Paperback
9.46
€
/
Paperback
17.62
€
/
Paperback
42.59
€
/
Paperback
13.89
€
/
Kalender
11.07
€
Hoi! Ik ben Libroamiko, je boekadviseur.
Hoe kan ik je helpen?