出典:Wikipedia
出典:『Wikipedia』 (2010/12/07 21:53 UTC 版)
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 (an NP-complete problem) can in fact be solved in polynomial time.
| ・COLOR-CODING | |
| ・Otloh | |
| ・wall rocks | |
| ・in Mate | |
| ・Heineccius | |
| ・locu | |
| ・ascafan | |
| ・wema | |
| ・busiri | |
| ・routine planning |