Related Experiment Video
Updated: Oct 10, 2025

Temporal Ordering of Dynamic Expression Data from Detailed Spatial Expression Maps
Published on: February 9, 2017
A Graph Coloring Algorithm for Large Scheduling Problems
1Center for Applied Mathematics, National Bureau of Standards Washington, DC 20234.
Abstract:
A new graph coloring algorithm is presented and compared to a wide variety of known algorithms. The algorithm is shown to exhibit O(n 2) time behavior for most sparse graphs and thus is found to be particularly well suited for use with large-scale scheduling problems. In addition, a procedure for generating large random test graphs with known chromatic number is presented and is used to evaluate heuristically the capabilities of the algorithms discussed.
Related Concept Videos
Vector Algebra: Graphical Method
We use the laws of geometry to construct resultant vectors, followed by trigonometry to find vector magnitudes and directions. For a geometric construction of the sum of two vectors in a plane, we follow the parallelogram rule. Suppose two vectors are at arbitrary positions. Translate either one of...
Theorems of Pappus and Guldinus: Problem Solving
Statically Indeterminate Problem Solving
Castigliano's Theorem: Problem Solving
SFG Algebra
Each node in an SFG corresponds to a variable, and the interactions between nodes are represented by branches with associated gains. When multiple branches lead into a node, the value at that node is the sum of the...
Fast Decoupled and DC Powerflow

