List price: US$38.01

Currently unavailable

Add to wishlist

AbeBooks may have this title (opens in new window).

Try AbeBooks


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 more

Product details

  • Paperback | 64 pages
  • 152 x 229 x 4mm | 104g
  • Stapress
  • United States
  • English
  • black & white illustrations
  • 6136276046
  • 9786136276045