We study the problem of adding edges to a given arbitrary graph so that the resulting graph is a comparability graph, called a comparability completion of the input graph. Computing a comparability completion with the minimum possible number of added edges is an NP-hard problem. Our purpose here is to add an inclusion minimal set of edges to obtain a minimal comparability completion, which mean...

This paper analyzes the bene…ts and costs of …nancial statement comparability from an information perspective. We …rst show analytically that while comparability enhances the correlation among …rms’reported earnings (“common informativeness”), it reduces …rms’own reporting precision (“individual informativeness”). Next, we provide theoretical justi…cation for the comparability measure of De Fra...

Ma and Spinrad have shown that every transitive orientation of a chordal comparability graph is the intersection of four linear orders. That is, chordal comparability graphs are comparability graphs of posets of dimension four. Among other uses, this gives an implicit representation of a chordal comparability graph using O(n) integers so that, given two vertices, it can be determined inO(1) tim...

We address in this paper the co-clustering and co-classification of bilingual data laying in two linguistic similarity spaces when a comparability measure defining a mapping between these two spaces is available. A new approach that we can characterized as a three-mode data analysis scheme, is proposed to mix the comparability measure with the two similarity measures. Our aim is to improve join...

This paper develops and discusses a framework for the assessment of statistical quality in EU-SILC, with focus on comparability as a central dimension of quality. We view data quality as a multidimensional concept, covering not only statistical accuracy but also the relevance, timeliness, comprehensiveness, etc., of the data. There is a broad agreement on what dimensions make up the overall qua...