Color coding computer science graph (1 résultats)

Taschenbuch. Etat : Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Please note that the content of this book primarily consists of articlesavailable from Wikipedia or other free sources online. In computerscience and graph theory, the method of color-coding efficiently findsk-vertex simple paths, k-vertex cycles, and other small subgraphs withina given graph using probabilistic algorithms, which can then bederandomized and turned into deterministic algorithms. This method showsthat many subcases of the subgraph isomorphism problem can in fact besolved in polynomial time. The theory and analysis of the color-codingmethod was proposed in 1994 by Noga Alon, Raphael Yuster, and Uri Zwick.…