Linear-semiorders and their incomparability graphs

07/18/2019
by   Asahi Takaoka, et al.
0

A linear-interval order is the intersection of a linear order and an interval order. For this class of orders, several structural results have been shown. In this paper, we study a natural subclass of linear-interval orders. We call a partial order a linear-semiorder if it is the intersection of a linear order and a semiorder. We show a characterization of linear-semiorders in terms of linear extensions. This gives a vertex ordering characterization of their incomparability graphs. We also show that being a linear-semiorder is a comparability invariant.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/06/2021

Partial order alignment by adjacencies and breakpoints

Linearizing two partial orders to maximize the number of adjacencies and...
research
09/28/2019

Characterization and Linear-time Recognition of Paired Threshold Graphs

In a paired threshold graph, each vertex has a weight, and two vertices ...
research
05/24/2023

Learning the String Partial Order

We show that most structured prediction problems can be solved in linear...
research
01/01/2023

Exactly Hittable Interval Graphs

Given a set system 𝒳 = {𝒰,𝒮}, where 𝒰 is a set of elements and 𝒮 is a se...
research
08/14/2022

Novel Ordering-based Approaches for Causal Structure Learning in the Presence of Unobserved Variables

We propose ordering-based approaches for learning the maximal ancestral ...
research
02/18/2020

On unbounded directions of linear interval parametric systems and their extensions to AE solutions

We consider a system of linear equations, whose coefficients depend line...
research
07/27/2014

Defining Relative Likelihood in Partially-Ordered Preferential Structures

Starting with a likelihood or preference order on worlds, we extend it t...

Please sign up or login with your details

Forgot password? Click here to reset