Fractional weak discrepancy and split semiorders (Q531608): Difference between revisions

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A short proof that `proper = unit' / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intransitive indifference with unequal indifference intervals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Characterization of Mixed Unit Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integral mixed unit interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unit Interval Graphs of Open and Closed Intervals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5588432 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundational aspects of theories of measurement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unit Mixed Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4004146 / rank
 
Normal rank

Latest revision as of 12:17, 11 July 2024

scientific article; zbMATH DE number 6548280
  • Unit interval orders of open and closed intervals.
Language Label Description Also known as
English
Fractional weak discrepancy and split semiorders
scientific article; zbMATH DE number 6548280
  • Unit interval orders of open and closed intervals.

Statements

Fractional weak discrepancy and split semiorders (English)
0 references
Unit interval orders of open and closed intervals. (English)
0 references
0 references
0 references
0 references
0 references
19 April 2011
0 references
2 March 2016
0 references
fractional weak discrepancy
0 references
split semiorders
0 references
forcing cycle
0 references
posets
0 references
forbidden subposets
0 references
unit interval orders
0 references
proper interval orders
0 references
semiorders
0 references
mixed interval graphs
0 references
efficient algorithms
0 references
The authors deal with poset \(P=(X,\prec)\) as a unit OC interval order and give a forbidden poset characterization of the class of unit OC interval orders and an efficient algorithm for recognizing the class. The algorithm takes a poset \(P\) as the input. It produces a representation or returns a forbidden poset induced in \(P\).
0 references

Identifiers

0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references