In this paper, we consider the mutual exclusion scheduling problem for comparability graphs. Given an undirected graph G and a xed constant m, the problem is to nd a minimum coloring of G such that each color is used at most m times. The complexity of this problem for comparability graphs was mentioned as an open problem by M ohring (1985) and for permutation graphs (a subclass of comparabilit...

BACKGROUND Longitudinal micro-level data about international migration behavior are notoriously difficult to collect, but data collection efforts have become more frequent in recent years. Comparative research of the patterns and processes of international migration, however, remains quite rare, especially that which compares across regions. OBJECTIVE We highlight the promises and difficultie...

We investigate the relationship between board diversity (relation-oriented diversity, task-oriented and overall diversity) financial statement comparability. find that diverse boards are positively associated with comparability, suggesting improves governance mechanisms by alleviating agency conflicts, leading to higher comparability than homogenous boards. also institutional ownership affects ...

This paper studies market competition when firms can influence consumers’ ability to compare market alternatives, through their choice of price “formats”. We introduce random graphs as a tool for modeling limited comparability of formats. Our main results concern the interaction between firms’ equilibrium price and format decisions and its implications for industry profits and consumer switchin...

Let Sn and Bn denote the respective sets of ordinary and bigrassmannian (BG) permutations of order n, and let (Sn,≤) denote the Bruhat ordering permutation poset. We study the restricted poset (Bn,≤), first providing a simple criterion for comparability. This criterion is used to show that that the poset is connected, to enumerate the saturated chains between elements, and to enumerate the numb...

Cross-Language Information Retrieval (CLIR) and machine translation (MT) resources, such as dictionaries and parallel corpora, are scarce and hard to come by for special domains. Besides, these resources are just limited to a few languages, such as English, French, and Spanish and so on. So, obtaining comparable corpora automatically for such domains could be an answer to this problem effective...

LEVEL: INTERMEDIATE C hallenges and approaches in demonstrating comparability of a well-characterized biotechnology product after manufacturing changes can be as varied and complex as the products themselves. Participants at the January 2005 CMC Strategy Forum sought to discuss and agree on common implementation strategies for different manufacturing change scenarios. Development of flexible, c...

Citation: Alamri Y, MacAskill M and Anderson T (2017) Commentary: Aiming for Study Comparability in Parkinson’s Disease: Proposal for a Modular Set of Biomarker Assessments to be Used in Longitudinal Studies. Front. Aging Neurosci. 8:331. doi: 10.3389/fnagi.2016.00331 Commentary: Aiming for Study Comparability in Parkinson’s Disease: Proposal for a Modular Set of Biomarker Assessments to be Use...

Characterisations of interval graphs, comparability graphs, co-comparability graphs, permutation graphs, and split graphs in terms of linear orderings of the vertex set are presented. As an application, it is proved that interval graphs, cocomparability graphs, AT-free graphs, and split graphs have bandwidth bounded by their maximum degree.

LEVEL: INTERMEDIATE C onfidence in the reliability and comparability of results is a primary requirement for measurements made in both industrial and clinical environments. The increased uptake and wider application of molecular biological methods requires assurance of the accuracy, reliability, and comparability of the techniques. However, there are a number of difficulties. The variety of ava...