BDD Techniques for Graph Coloring and Related Problems

Abstract

Graph coloring is a general solution to the scheduling problem. Variants of the scheduling problem abound in computer engineering CAD problems. BDDs, which have efficient set and data compression properties, are a tool useful for solving NP-Complete problems such as the graph coloring problem. This report explores BDD techniques helpful for determining the… (More)

Topics

  • Presentations referencing similar topics