Isomorphism Testing for Restricted Graph Classes: On the complexity of isomorphism testing and reachability problems for restric,Used

Isomorphism Testing for Restricted Graph Classes: On the complexity of isomorphism testing and reachability problems for restric,Used

In Stock
SKU: DADAX3838119541
Brand: Sudwestdeutscher Verlag Fur Hochschulschriften AG
Condition: New
$158.23
Quantity
Add to wishlist
Add to compare
Sold by Ergodebooks, an authorized reseller.

Processing time: 1-3 days

US Orders Ships in: 3-5 days

International Orders Ships in: 8-12 days

Return Policy: 15-days return on defective items

Payment Option
Payment Methods

Help

If you have any questions, you are always welcome to contact us. We'll get back to you as soon as possible, withing 24 hours on weekdays.

Customer service

All questions about your order, return and delivery must be sent to our customer service team by e-mail at yourstore@yourdomain.com

Sale & Press

If you are interested in selling our products, need more information about our brand or wish to make a collaboration, please contact us at press@yourdomain.com

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 NPcomplete 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_5minor 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.

⚠️ WARNING (California Proposition 65):

This product may contain chemicals known to the State of California to cause cancer, birth defects, or other reproductive harm.

For more information, please visit www.P65Warnings.ca.gov.

Recently Viewed