Interval graphs and interval orders
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 4091559
- scientific article; zbMATH DE number 426339
- Interval \(k\)-graphs and orders
- scientific article; zbMATH DE number 1057882
- scientific article; zbMATH DE number 3877239
- Combinatorial aspects of interval orders and interval graphs
- scientific article; zbMATH DE number 4195994
- Uniquely orderable interval graphs
- Interval graphs and related topics
- scientific article; zbMATH DE number 1958549
Cites work
- A characterization of uniquely representable interval graphs
- Aspects of semiorders within interval orders
- Counting Interval Graphs
- Foundational aspects of theories of measurement
- scientific article; zbMATH DE number 3857173 (Why is no real title available?)
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 3598234 (Why is no real title available?)
- scientific article; zbMATH DE number 3307330 (Why is no real title available?)
- Interval lengths for interval orders: A minimization problem
- Intransitive indifference with unequal indifference intervals
- Maximum Semiorders in Interval Orders
- Paradoxes of two-length interval orders
- Representation of a finite graph by a set of intervals on the real line
- Restricted thresholds for interval orders: A case of nonaxiomatizability by a universal sentence
- Threshold-Bounded Interval Orders and a Theory of Picycles
Cited in
(only showing first 100 items - show all)- Mutual exclusion scheduling with interval graphs or related classes. I
- A characterization of uniquely representable interval graphs
- Minimizing bumps in linear extensions of ordered sets
- Counting interval orders
- Continuous semiorder representations
- Interval orders and circle orders
- Algorithmic aspects of intersection graphs and representation hypergraphs
- Revealed preference and intransitive indifference
- Tackling the jump number of interval orders
- Norbert Wiener on the theory of measurement (1914, 1915, 1921)
- Planar lattices are lexicographically shellable
- \(N\)-free orders and minimal interval extensions
- Minimal representation of a semiorder
- Preference through indifference: A topological approach
- Interval dimension and MacNeille completion
- Detecting causal relationships in distributed computations: In search of the holy grail
- 3-interval irreducible partially ordered sets
- Diversity and dissimilarity in lines and hierarchies
- Basic interval orders
- Media theory
- Stochastic dominance with imprecise information
- Approximations of arbitrary relations by partial orders
- Strict \((m, 1)\)-Ferrers properties
- Interval-valued rank in finite ordered sets
- Necessary and possible indifferences
- Extended formulations for order polytopes through network flows
- Tractabilities and intractabilities on geometric intersection graphs
- On the classes of interval graphs of limited nesting and count of lengths
- Interval semantics for Petri nets with inhibitor arcs
- Numerical representation of PQI interval orders
- The lattice of strict completions of a finite poset.
- Rational choice with status quo bias
- Linear extensions and comparable pairs in partial orders
- Interval \(k\)-graphs and orders
- Koszul binomial edge ideals of pairs of graphs
- Handling imprecise evaluations in multiple criteria decision aiding and robust ordinal regression by n-point intervals
- The dimension of cycle-free orders
- Sign types associated to posets
- Semiorders and the 1/3-2/3 conjecture
- Aggregation of semiorders: Intransitive indifference makes a difference
- Any complete preference structure without circuit admits an interval representation
- Necessary and possible preference structures
- Normal Helly circular-arc graphs and its subclasses
- Interval graph limits
- Jónsson posets
- Graphs of interval count two with a given partition
- Declawing a graph: polyhedra and branch-and-cut algorithms
- On subclasses of interval count two and on Fishburn's conjecture
- A note on reference-dependent choice with threshold representation
- Two problems on interval counting
- Uniquely orderable interval graphs
- 2-nested matrices: towards understanding the structure of circle graphs
- The interplay between transitivity and completeness: generalized \textsf{NaP}-preferences
- Continuous representations of interval orders by means of two continuous functions
- A bi-preference interplay between transitivity and completeness: reformulating and extending Schmeidler's theorem
- Asymptotics and statistics on Fishburn matrices and their generalizations
- Unit representation of semiorders. I: Countable sets
- Unit representation of semiorders. II: The general case
- Paradoxes of two-length interval orders
- A probabilistic framework for the design of instance-based supervised ranking algorithms in an ordinal setting
- Ordered sets with interval representation and (m,n)-Ferrers relation
- Computer science and decision theory
- Nontransitive preferences in decision theory
- Machine learning models, epistemic set-valued data and generalized loss functions: an encompassing approach
- From set relations to belief function relations
- Simultaneous consecutive ones submatrix and editing problems: classical complexity and fixed-parameter tractable results
- Hereditary semiorders and enumeration of semiorders by dimension
- Generalization of Portmanteau theorem for a sequence of interval-valued pseudo-probability measures
- Interval orders, semiorders and ordered groups
- Generation and enumeration of some classes of interval orders
- A general concept of scoring rules: general definitions, statistical inference, and empirical illustrations
- Database querying under changing preferences
- Congruence relations on a choice space
- A \textit{branch} \& \textit{price} algorithm for the minimum cost clique cover problem in max-point tolerance graphs
- Critically prime orders
- Finite dimensional scattered posets
- Min-max decision rules for choice under complete uncertainty: axiomatic characterizations for preferences over utility intervals
- Upper semicontinuous representations of interval orders
- A characterization of 2-tree probe interval graphs
- Expected utility with nonlinear threshold
- Dimension of CPT posets
- Bi-symmetric multiple equidistributions on ascent sequences
- Convex and extendable partitions of a lattice
- Combinatorial aspects of interval orders and interval graphs
- Rights revisited, and limited
- Evaluations of Hecke algebra traces at Kazhdan-Lusztig basis elements
- Cycle transversals in bounded degree graphs
- On representing an interval graph using the minimum number of interval lengths
- Continuum limits for classical sequential growth models
- $n!$ matchings, $n!$ posets
- (m, n)-rationalizable choices
- Universal semiorders
- Preferences in artificial intelligence
- Injective envelopes of transition systems and Ferrers languages
- Algebraic representation, dualities and beyond
- scientific article; zbMATH DE number 3877239 (Why is no real title available?)
- Homogeneously Representable Interval Bigraphs
- Bipolar preference modeling and aggregation in decision support
- Some Remarks on Approximations of Arbitrary Binary Relations by Partial Orders
- scientific article; zbMATH DE number 5556718 (Why is no real title available?)
This page was built for publication: Interval graphs and interval orders
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1060230)
