# Changing a relation to become transitive

Given a binary relation $$R$$ on a finite set $$S$$, is there an efficient algorithm to transform $$R$$ to a transitive relation $$R'$$ by minimum number of addition or deletion of pairs $$(x,y)$$ to or from $$R$$ where $$x,y \in S$$?