Exact algorithms for L(2,1)-labelings of graphs

Abstrakt

An exponential algorithm for finding L(2, 1)-labelings of graphs is presented that improves upon the trivial one; for colors 0, 1, ..., 4 it works in time O(1.3006^n).

Klíčová slova

• Exact
• algorithms
• L2,1-labelings
• graphs