Graph Isomorphismus Problem: Seine strukturelle Komplexität, Hardcover von Kobler, J...
116,83 €
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.
Jetzt bei Ebay:
