A new DSATUR-based algorithm for exact vertex coloring


This paper describes a new exact algorithm PASS for the vértex coloring problem based on the well Keywordsknown DSATUR algorithm. At each step DSATUR maximizes saturation degree to select a new candidate Color vértex to color, breaking ties by máximum degree w.r.t. uncolored vértices. Later Sewell introduced a Graph new tiebreaking strategy, which evaluated… (More)
DOI: 10.1016/j.cor.2011.10.008


6 Figures and Tables


Citations per Year

Citation Velocity: 18

Averaging 18 citations per year over the last 3 years.

Learn more about how we calculate this metric in our FAQ.

Slides referencing similar topics