Skip to search formSkip to main contentSkip to account menu
You are currently offline. Some features of the site may not work correctly.

Color-coding

Known as: The Method of Color-coding 
In computer science and graph theory, the method of color-coding efficiently finds k-vertex simple paths, k-vertex cycles, and other small subgraphs… 
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2017
Highly Cited
2017
Given a set Z of n positive integers and a target value t, the S ubset S um problem asks whether any subset of Z sums to t. A… 
Highly Cited
2016
Highly Cited
2016
It is important to understand both what a classification metric expresses and what it hides. 
  • figure 2
  • figure 1
  • figure 3
  • figure 4
Highly Cited
2008
Highly Cited
2008
We study the NP-complete Graph Motif problem: given a vertex-colored graph G= (V,E) and a multiset Mof colors, does there exist… 
  • figure 1
Highly Cited
2007
Highly Cited
2007
Abstract Color-coding is a technique to design fixed-parameter algorithms for several NP-complete subgraph isomorphism problems… 
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
2003
Highly Cited
2003
Traffic flow management (TFM) in the U.S. is the process by which the Federal Aviation Administration (FAA), with the… 
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
Highly Cited
2002
Highly Cited
2002
We propose a new method for color demosaicing based on a mathematical model of spatial multiplexing of color. We demonstrate that… 
  • figure 2
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Highly Cited
2001
Highly Cited
2001
A charge storage device and method of manufacture of the type in which a target electrode provides a plurality of spatially… 
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
1995
Highly Cited
1995
We describe a novel randomized method, the method of color-coding for finding simple paths and cycles of a specified length k… 
Highly Cited
1995
Highly Cited
1995
  • T. Kohonen
  • Springer Series in Information Sciences
  • 1995
  • Corpus ID: 54122395
The Self-Organising Map (SOM) algorithm was introduced by the author in 1981. Its theory and many applications form one of the… 
Highly Cited
1992
Highly Cited
1992
A previously proposed theory of visual processing, based on redundancy reduction, is used to derive the retinal transfer function…