Skip to search formSkip to main contentSkip to account menu

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 (opens in a new tab)

Related topics

Related topics

11 relations
Computer scienceCycle (graph theory)Deterministic algorithmGraph theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2016
Highly Cited
2016
Points of Significance: Classification evaluation
It is important to understand both what a classification metric expresses and what it hides. 
Highly Cited
2016
Highly Cited
2016
A Near-Linear Pseudopolynomial Time Algorithm for Subset Sum
  • K. Bringmann
  • ACM-SIAM Symposium on Discrete Algorithms
  • 2016
  • Corpus ID: 8317733
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… 
Review
2012
Review
2012
Guiding the interactive exploration of metabolic pathway interconnections
Approaches to investigate biological processes have been of strong interest in the past few years and are the focus of several… 
Highly Cited
2003
Highly Cited
2003
MEASURING UNCERTAINTY IN AIRSPACE DEMAND PREDICTIONS FOR TRAFFIC FLOW MANAGEMENT APPLICATIONS
Traffic flow management (TFM) in the U.S. is the process by which the Federal Aviation Administration (FAA), with the… 
Highly Cited
2002
Highly Cited
2002
Color Demosaicing by Estimating Luminance and Opponent Chromatic Signals in the Fourier Domain
We propose a new method for color demosaicing based on a mathematical model of spatial multiplexing of color. We demonstrate that… 
Highly Cited
2001
Highly Cited
2001
Streaming QSplat: a viewer for networked visualization of large, dense models
A charge storage device and method of manufacture of the type in which a target electrode provides a plurality of spatially… 
Highly Cited
1995
Highly Cited
1995
Color-coding
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
Self-Organizing Maps
  • 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
Understanding Retinal Color Coding from First Principles
A previously proposed theory of visual processing, based on redundancy reduction, is used to derive the retinal transfer function… 
1992
1992
Diagrammatic Displays for Engineered Systems: Effects on Human Performance in Interacting with Malfunctioning Systems
  • D. Kieras
  • Int. J. Man Mach. Stud.
  • 1992
  • Corpus ID: 15634082
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)