The graph isomorphism problem belongs to the part of Complexity Theory that focuses on the structure of complexity classes involved in the classification of computational problems and in the relations among them. It consists in deciding whether two given graphs are isomorphic, i.e. whether there is a bijective mapping from the nodes of one graph to the nodes of the second graph such that the edge connections are respected. It is a problem of considerable practical as wen as theoretical importance that is, as of now, ...
Read More
The graph isomorphism problem belongs to the part of Complexity Theory that focuses on the structure of complexity classes involved in the classification of computational problems and in the relations among them. It consists in deciding whether two given graphs are isomorphic, i.e. whether there is a bijective mapping from the nodes of one graph to the nodes of the second graph such that the edge connections are respected. It is a problem of considerable practical as wen as theoretical importance that is, as of now, unresolved in the sense that no efficient algorithm for it has yet been found. Given this fact, it is natural to ask whether such an algorithm exists at an or whether the problem is intractable. -Be book focuses on this issue and presents several recent results that provide a better understanding of the relative position of the graph isomorphism problem in the class NP as well as in other complexity classes. It also uses the problem to illustrate important concepts in structural complexity, providing a look into the more general theory. 'The book is basically self-contained; the only prerequisite for reading it is some elementary knowledge from Complexity Theory and Probability Theory. Its level of presentation makes it eminently suitable for a seminar or graduate course devoted to the problem, or as a rich source of examples for a standard graduate course in Complexity Theory.
Read Less
Add this copy of The Graph Isomorphism Problem: Its Structural to cart. $103.32, new condition, Sold by Ingram Customer Returns Center rated 5.0 out of 5 stars, ships from NV, USA, published 2012 by Springer-Verlag New York Inc..
Add this copy of The Graph Isomorphism Problem: Its Structural to cart. $84.00, good condition, Sold by ThriftBooks-Atlanta rated 5.0 out of 5 stars, ships from Brownstown, MI, UNITED STATES, published 1993 by Birkhauser.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
Good. Shelf and handling wear to cover and binding, with general signs of previous use. Wear commensurate with age and use. Former owner's name sticker pasted onto front inside board, otherwise clean and unmarked copy. Light bumping visible to corners of boards and ends of spine strip. Secure packaging for safe delivery.
Add this copy of The Graph Isomorphism Problem: Its Structural to cart. $85.82, new condition, Sold by Book Forest rated 5.0 out of 5 stars, ships from San Rafael, CA, UNITED STATES, published 1993 by Birkhauser.
Add this copy of The Graph Isomorphism Problem: Its Structural to cart. $103.32, new condition, Sold by Ingram Customer Returns Center rated 5.0 out of 5 stars, ships from NV, USA, published 1993 by Birkhauser.
Add this copy of The Graph Isomorphism Problem: Its Structural to cart. $113.05, new condition, Sold by GreatBookPrices rated 4.0 out of 5 stars, ships from Columbia, MD, UNITED STATES, published 1993 by Birkhauser.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
New. Sewn binding. Cloth over boards. 160 p. Contains: Unspecified. Progress in Theoretical Computer Science. In Stock. 100% Money Back Guarantee. Brand New, Perfect Condition, allow 4-14 business days for standard shipping. To Alaska, Hawaii, U.S. protectorate, P.O. box, and APO/FPO addresses allow 4-28 business days for Standard shipping. No expedited shipping. All orders placed with expedited shipping will be cancelled. Over 3, 000, 000 happy customers.
