When you click on links to various merchants on this site and make a purchase, this can result in this site earning a commission. Affiliate programs and affiliations include, but are not limited to, the eBay Partner Network.
Graph Isomorphism Problem : Its Structural Complexity, Hardcover by Kobler, J...
- Item No : 388738165035
- Condition : Like New
- Brand : No brand Info
- Seller : greatbookprices1
- Current Bid : US $137.83
-
* Item Description
- Graph Isomorphism Problem : Its Structural Complexity, Hardcover by Kobler, Johannes; Schoning, Uwe; Toran, Jacobo, ISBN 0817636803, ISBN-13 9780817636807, Like New Used, Free shipping in the US The question is whether or not an efficient algorithm exists by which to determine whether or not two given graphs are isomorphic, that is, whether nodes can be mapped from one to the other without violating the edge connections. The answer, so far, is yes, but only by assuming some hypotheses that might well turn out to be false. For readers with a graduate-level understanding of complexity and probability theory. Annotation copyright Book News, Inc. Portland, Or.
★ Recommended Products Related To This Item
♥ Best Selling Products in this category
