Items related to Color-coding: Computer science, Graph theory, Randomized...
Synopsis
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In computer science and graph theory, the method of color-coding efficiently finds k-vertex simple paths, k-vertex cycles, and other small subgraphs within a given graph using probabilistic algorithms, which can then be derandomized and turned into deterministic algorithms. This method shows that many subcases of the subgraph isomorphism problem can in fact be solved in polynomial time. The theory and analysis of the color-coding method was proposed in 1994 by Noga Alon, Raphael Yuster, and Uri Zwick.
"synopsis" may belong to another edition of this title.
Search results for Color-coding: Computer science, Graph theory, Randomized...
Seller Image
Color-coding : Computer science, Graph theory, Randomized algorithm
Print on DemandSeller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: 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. Seller Inventory # 9786136276045