£80.00

It has never been this cheap. We have no record of a lower price.

£80 today · cheaper than every other day in the last 3 months

Südwestdeutscher Verlag für Hochschulschriften Isomorphism Testing for Restricted Graph Classes: On the complexity of isomorphism testing and reachability problems for restricted graph classes

View at Amazon

Price History & Forecast

Grey patches = out of stock. Cheaper = lower on the chart. Hover for exact prices.

Last 46 days · 46 data points (no recent data)

Historical
Generating forecast…
£80.00 £76.00 £77.60 £79.20 £80.80 £82.40 £84.00 26 July 2026 06 August 2026 17 August 2026 28 August 2026 09 September 2026
View at Amazon ↗

NEW HERE?

Amazon shows you one price. We show you all of them.

Tosheroon watches Amazon prices so you don't have to. Every product on Amazon has a price history — we make it visible. Set the price you'd actually pay, and we'll email you the second it gets there. No app, no account, one email.

WHAT'S ON THIS PAGE

↑ Price chart
when this has been cheap or pricey
↑ Forecast
where the price is heading next
↓ Statistics
all-time high & low, recent range
↑ Price alert
name your number, we'll email you

Price Distribution

Price distribution over 46 days • 1 price levels

Days at Price
46 days 0 12 23 35 46 £80 Days at Price

Price Analysis

Most common price: £80 (46 days, 100.0%)

Price range: £80 - £80

Price levels: 1 different prices over 46 days

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

Format
paperback
Domain
Amazon UK
Release Date
26 August 2010
Listed Since
31 August 2010

Barcode

No barcode data available

Similar Products You Might Like

Isomorphisms, Symmetry and Computations in Algebraic Graph Theory: Pilsen, Czech Republic, October 3–7, 2016: 305 (Springer Proceedings in Mathematics & Statistics, 305)
95% match

Isomorphisms, Symmetry and Computations in Algebraic Graph Theory: Pilsen, Czech Republic, October 3–7, 2016: 305 (Springer Proceedings in Mathematics & Statistics, 305)

Springer

£51.58 24 Sep 2026
Certifying Rule-Based Models using Graph Transformation: Extended, Improved and New Graph Transformation Analysis Techniques: Clearing the Way for a General Road Map to Certification
94% match

Certifying Rule-Based Models using Graph Transformation: Extended, Improved and New Graph Transformation Analysis Techniques: Clearing the Way for a General Road Map to Certification

Südwestdeutscher Verlag für Hochschulschriften

£81.00 25 Sep 2026
Extremal Graph and Hypergraph Theory: With Ramsey Theory (Cambridge Studies in Advanced Mathematics)
94% match

Extremal Graph and Hypergraph Theory: With Ramsey Theory (Cambridge Studies in Advanced Mathematics)

Cambridge University Press

£61.11 28 Aug 2026
Recent Advancements in Graph Theory (Mathematical Engineering, Manufacturing, and Management Sciences)
94% match

Recent Advancements in Graph Theory (Mathematical Engineering, Manufacturing, and Management Sciences)

CRC Press

£60.21 02 Oct 2026
Structural Pattern Recognition using Graph Matching: Approximate and Error-Tolerant Algorithms
94% match

Structural Pattern Recognition using Graph Matching: Approximate and Error-Tolerant Algorithms

Chapman and Hall/CRC

£119.40 03 Oct 2026
Matrix Graph Grammars: An Algebraic Approach to Graph Dynamics
94% match

Matrix Graph Grammars: An Algebraic Approach to Graph Dynamics

VDM Verlag

£71.00 24 Sep 2026
Topics in Graph Theory (Discrete Mathematics and Its Applications)
94% match

Topics in Graph Theory (Discrete Mathematics and Its Applications)

Chapman and Hall/CRC

£84.70 12 Sep 2026
Graph Theory - Advanced Algorithms and Applications
94% match

Graph Theory - Advanced Algorithms and Applications

IntechOpen

£114.00 23 Sep 2026
Network Resilience Through Graph Theory: A Comprehensive Study of Closely-connected Vertices and Fault-Tolerant Systems
94% match

Network Resilience Through Graph Theory: A Comprehensive Study of Closely-connected Vertices and Fault-Tolerant Systems

LAP Lambert Academic Publishing

£69.50 23 Sep 2026
Sequential and Parallel Algorithms on Intersection Graphs
94% match

Sequential and Parallel Algorithms on Intersection Graphs

LAP Lambert Academic Publishing

£69.00 19 Sep 2026
Algorithms on Trees and Graphs
94% match

Algorithms on Trees and Graphs

Springer

£60.99 23 Sep 2026
Graph Theory: Researches and Applications
94% match

Graph Theory: Researches and Applications

Clanrye International

£60.20 01 Oct 2026
Graph Structure Theory (Contemporary Mathematics): Proceedings of the Ams-Ims-Siam Joint Summer Research Conference on Graph Minors Held June 22 to July 5, 1991, With Support
94% match

Graph Structure Theory (Contemporary Mathematics): Proceedings of the Ams-Ims-Siam Joint Summer Research Conference on Graph Minors Held June 22 to July 5, 1991, With Support

£105.00 02 Oct 2026
Symmetry Measures on Complex Networks
94% match

Symmetry Measures on Complex Networks

MDPI AG

£75.66 19 Sep 2026
Every Tree is a Subtree of a Graceful Unicyclic Graph: Graph Embedding
94% match

Every Tree is a Subtree of a Graceful Unicyclic Graph: Graph Embedding

LAP Lambert Academic Publishing

£66.99 25 Sep 2026
Graph Theory: Fundamentals and Applications
94% match

Graph Theory: Fundamentals and Applications

Elsevier

£79.34 23 Sep 2026
New Frontiers in Graph Theory
94% match

New Frontiers in Graph Theory

IntechOpen

£64.09 30 Sep 2026
Recent Trends in Domination in Graph Theory: New Domination Parameters, Bounds and Links with other parameters
94% match

Recent Trends in Domination in Graph Theory: New Domination Parameters, Bounds and Links with other parameters

LAP Lambert Academic Publishing

£58.99 24 Sep 2026
Methods of Graph Decompositions
94% match

Methods of Graph Decompositions

Oxford University Press

£96.48 22 Sep 2026
94% match

Inverse Problems, Geometric and Topological Aspects of Representation Theory, and Low-Dimensional Topology (Contemporary Mathematics)

Wiley

£116.00 29 Sep 2026
Dual Domination In Neutrosophic SuperHyperGraphs 3
93% match

Dual Domination In Neutrosophic SuperHyperGraphs 3

£56.38 17 Sep 2026
Classification Algorithms For Graphs, Digraphs, and Linear Spaces: Classification Algorithms For Graphs, Digraphs, and Linear Spaces
93% match

Classification Algorithms For Graphs, Digraphs, and Linear Spaces: Classification Algorithms For Graphs, Digraphs, and Linear Spaces

LAP Lambert Academic Publishing

£70.00 25 Sep 2026
Dual Domination In Neutrosophic SuperHyperGraphs 4
93% match

Dual Domination In Neutrosophic SuperHyperGraphs 4

£61.99 17 Sep 2026
Graph-Theoretic Concepts in Computer Science: 47th International Workshop, WG 2021, Warsaw, Poland, June 23–25, 2021, Revised Selected Papers: 12911 (Lecture Notes in Computer Science, 12911)
93% match

Graph-Theoretic Concepts in Computer Science: 47th International Workshop, WG 2021, Warsaw, Poland, June 23–25, 2021, Revised Selected Papers: 12911 (Lecture Notes in Computer Science, 12911)

Springer

£64.57 10 Sep 2026