Call Us 080-41656200 (Mon-Sat: 10AM-8PM)
Free Shipping above Rs. 1499
Cash On Delivery*

Isomorphism Testing for Restricted Graph Classes


Marketed By :  Südwestdeutscher Verlag für Hochschulschriften   Sold By :  Kamal Books International  
Delivery in :  10-12 Business Days


Check Your Delivery Options

  • Product Description

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.

Product Specifications
SKU :COC16765
AuthorFabian Wagner
Number of Pages244
Publishing Year8/26/2010
Edition1 st
Book TypeComputer networking & communications
Country of ManufactureIndia
Product BrandSüdwestdeutscher Verlag für Hochschulschriften
Product Packaging InfoBox
In The Box1 Piece
Product First Available On ClickOnCare.com2015-07-25 00:00:00