Group: mathematics
Topic: computational geometry
Topic: graphs
Topic: register allocation by graph coloring
 
Subtopic: chromatic number
Quote: chromatic number of a graph is the minimal number of colors to color the graph [»chaiGJ_1981]
 Subtopic: graph coloring algorithms
Quote: n_color a graph by removing nodes with fewer then n colors; many graphs fully colored [»chaiGJ_1981]
 Quote: 32_color a graph by recursively removing nodes with less than 32 colors; works well [»chaiGJ6_1982]
 Subtopic: heuristics
Quote: in graph coloring, urgency ranking sometimes useful but backtracking was not [»chaiGJ_1981]
 Quote: backtrack graph coloring according to urgency, i.e., uncolored_neighbors div unused_colors [»chaiGJ_1981]
 Subtopic: applications
Quote: use coloring to map frequently accessed elements to nonconflicting cache blocks [»chilTM12_2000]
 Quote: improve cache performance via copying garbage collector, objectoriented languages, and octree coloring; 42% speedup [»chilTM12_2000]

Related Topics
Group: mathematics (23 topics, 560 quotes)
Topic: computational geometry (20 items)
Topic: graphs (18 items)
Topic: register allocation by graph coloring (21 items)
