Kontakt
Wie einkaufen
Versand
Kaufberater
Isomorphism Testing for Restricted Graph Classes
On the complexity of isomorphism testing and reachability problems for restricted graph classes
Englisch
205 b
30 Tage für die Rückgabe der Ware
Kunden kauften auch
/
Hardcover
37.99
€
/
Hardcover
184.59
€
/
Hardcover
123.99
€
/
Broschur
27.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.
Informationen zum Buch
Englisch
Verschenken Sie dieses Buch noch heute
Es ist ganz einfach
1 Legen Sie das Buch in Ihren Warenkorb und wählen Sie den Versand als Geschenk 2 Wir schicken Ihnen umgehend einen Gutschein 3 Das Buch wird an die Adresse des beschenkten Empfängers geliefertDas könnte Sie auch interessieren
/
Broschur
18.09
€
/
Broschur
9.69
€
/
Broschur
13.59
€
/
Broschur
21.99
€
/
Broschur
20.99
€
Hallo! Ich bin Libroamiko, dein Buchberater.
Wie kann ich dir helfen?