Color Coding Computer Science Graph (1 results)

Title
Refine with Advanced Search

Refine your search

  • Books (1)

  • New (1)

to

Custom price range (£)

to

    • Language: English

      Published by Omniscriptum, 2026

      6136276046 / 9786136276045

      • Softcover
      • Print on Demand

      Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH

      5-star seller
      Contact seller

      Condition: New

      £ 143.42

      £ 26.15 shipping 
      Ships from Germany to U.S.A.

      Quantity: 1 available

      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.