Noun
dancing links (uncountable) (computing theory) A technique for reverting the deletion of a node from a circular doubly-linked list, particularly useful for efficiently implementing backtracking algorithms. Synonym: (abbreviation) DLX