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

From MaRDI portal
Merged Item from Q5965145
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Generalizations of semiorders: A review note / rank
 
Normal rank
Property / cites work
 
Property / cites work: Split semiorders / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Weakness of an Ordered Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828541 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Range of the fractional weak discrepancy function / rank
 
Normal rank
Property / cites work
 
Property / cites work: The fractional weak discrepancy of a partially ordered set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3626682 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fractional weak discrepancy and interval orders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear discrepancy and weak discrepancy of partially ordered sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(k\)-weak orders: Recognition and a tolerance result / rank
 
Normal rank

Revision as of 23:16, 3 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