Pages that link to "Item:Q1060230"
From MaRDI portal
The following pages link to Interval graphs and interval orders (Q1060230):
Displayed 50 items.
- How to revise a total preorder (Q535324) (← links)
- Biorders with frontier (Q633220) (← links)
- Counting general and self-dual interval orders (Q662031) (← links)
- Parallel interval order recognition and construction of interval representations (Q673637) (← links)
- An obvious proof of Fishburn's interval order theorem (Q685567) (← links)
- Counting endpoint sequences for interval orders and interval graphs (Q685648) (← links)
- Bounded discrete representations of interval orders (Q686255) (← links)
- Utility representation of an incomplete preference relation (Q697961) (← links)
- Linear extension majority cycles on partial orders (Q751946) (← links)
- Angle orders (Q762509) (← links)
- Unified representability of total preorders and interval orders through a single function: the lattice approach (Q841166) (← links)
- Circle orders and angle orders (Q908945) (← links)
- Embedding mappings and splittings with applications (Q968275) (← links)
- Mutual exclusion scheduling with interval graphs or related classes. I (Q1003752) (← links)
- Minimizing bumps in linear extensions of ordered sets (Q1077441) (← links)
- Counting interval orders (Q1098864) (← links)
- Continuous semiorder representations (Q1099048) (← links)
- Interval orders and circle orders (Q1114720) (← links)
- Algorithmic aspects of intersection graphs and representation hypergraphs (Q1119661) (← links)
- Revealed preference and intransitive indifference (Q1178813) (← links)
- Tackling the jump number of interval orders (Q1182058) (← links)
- Norbert Wiener on the theory of measurement (1914, 1915, 1921) (Q1193374) (← links)
- Planar lattices are lexicographically shellable (Q1198483) (← links)
- \(N\)-free orders and minimal interval extensions (Q1207724) (← links)
- Minimal representation of a semiorder (Q1262181) (← links)
- Preference through indifference: A topological approach (Q1300429) (← links)
- Interval dimension and MacNeille completion (Q1318360) (← links)
- Detecting causal relationships in distributed computations: In search of the holy grail (Q1331790) (← links)
- 3-interval irreducible partially ordered sets (Q1338127) (← links)
- Diversity and dissimilarity in lines and hierarchies (Q1398327) (← links)
- Media theory (Q1613392) (← links)
- Numerical representation of \(PQI\) interval orders (Q1766750) (← links)
- The lattice of strict completions of a finite poset. (Q1771910) (← links)
- Rational choice with status quo bias (Q1772664) (← links)
- The dimension of cycle-free orders (Q1803661) (← links)
- Sign types associated to posets (Q1806212) (← links)
- Semiorders and the 1/3-2/3 conjecture (Q1823267) (← links)
- Aggregation of semiorders: Intransitive indifference makes a difference (Q1890923) (← links)
- Any complete preference structure without circuit admits an interval representation (Q1908002) (← links)
- Necessary and possible preference structures (Q1949016) (← links)
- Normal Helly circular-arc graphs and its subclasses (Q1949109) (← links)
- Interval graph limits (Q1950423) (← links)
- A probabilistic framework for the design of instance-based supervised ranking algorithms in an ordinal setting (Q2271869) (← links)
- Ordered sets with interval representation and \((m,n)\)-Ferrers relation (Q2271872) (← links)
- Computer science and decision theory (Q2271874) (← links)
- Nontransitive preferences in decision theory (Q2276852) (← links)
- Generation and enumeration of some classes of interval orders (Q2376909) (← links)
- A general concept of scoring rules: general definitions, statistical inference, and empirical illustrations (Q2385063) (← links)
- Database querying under changing preferences (Q2385451) (← links)
- Critically prime orders (Q2427215) (← links)