Gunnar W. Klau, Centrum Wiskunde & Informatica (CWI)
5 June 2009
The term comparability editing is used wrongly throughout the paper. Comparability editing is the problem to transform an undirected graph into a comparability graph with the minimum number of edge insertions or deletions. A more appropriate name for the problem considered in this paper is transitivity editing.
Correction note
5 June 2009
The term comparability editing is used wrongly throughout the paper. Comparability editing is the problem to transform an undirected graph into a comparability graph with the minimum number of edge insertions or deletions. A more appropriate name for the problem considered in this paper is transitivity editing.
Competing interests
None declared