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
- 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?)
- A characterization of uniquely representable interval graphs
- Aspects of semiorders within interval orders
- Counting Interval Graphs
- Foundational aspects of theories of measurement
- 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)- Tackling the jump number of interval orders
- A probabilistic framework for the design of instance-based supervised ranking algorithms in an ordinal setting
- scientific article; zbMATH DE number 3877239 (Why is no real title available?)
- Combinatorial aspects of interval orders and interval graphs
- Revealed preference and intransitive indifference
- Preference Structures and Co-comparability Graphs
- Continuous semiorder representations
- Nontransitive preferences in decision theory
- Minimal representation of a semiorder
- Angle orders
- Catalan pairs and Fishburn triples
- Rational choice with status quo bias
- Utility representation of an incomplete preference relation
- Database querying under changing preferences
- Congruences for the Fishburn numbers
- scientific article; zbMATH DE number 91750 (Why is no real title available?)
- Fast-mixed searching and related problems on graphs
- A note on reference-dependent choice with threshold representation
- Bipolar preference modeling and aggregation in decision support
- Extremal interval graphs
- Unit representation of semiorders. I: Countable sets
- Chronological orderings of interval graphs
- Evaluations of Hecke algebra traces at Kazhdan-Lusztig basis elements
- Stochastic dominance with imprecise information
- On representing an interval graph using the minimum number of interval lengths
- Preference structures and threshold models
- A characterization of uniquely representable interval graphs
- Computer science and decision theory
- Ordered sets with interval representation and \((m,n)\)-Ferrers relation
- Minimizing bumps in linear extensions of ordered sets
- Any complete preference structure without circuit admits an interval representation
- Lexicographic aggregation of semiorders
- The pseudo-transitivity of preference relations: strict and weak \((m,n)\)-Ferrers properties
- Algorithmic aspects of intersection graphs and representation hypergraphs
- Parallel interval order recognition and construction of interval representations
- Generation and enumeration of some classes of interval orders
- Sign types associated to posets
- Unified representability of total preorders and interval orders through a single function: the lattice approach
- Counting endpoint sequences for interval orders and interval graphs
- Bounded discrete representations of interval orders
- Equidistributed statistics on Fishburn matrices and permutations
- Minimal obstructions for partial representations of interval graphs
- Aggregation of semiorders: Intransitive indifference makes a difference
- Approximations of arbitrary relations by partial orders
- Tractabilities and intractabilities on geometric intersection graphs
- Interval graph limits
- Detecting causal relationships in distributed computations: In search of the holy grail
- Preference through indifference: A topological approach
- On the classes of interval graphs of limited nesting and count of lengths
- scientific article; zbMATH DE number 4091559 (Why is no real title available?)
- Interval traces with mutex relation
- Norbert Wiener on the theory of measurement (1914, 1915, 1921)
- Counting general and self-dual interval orders
- An obvious proof of Fishburn's interval order theorem
- \((m, n)\)-rationalizable choices
- Universal semiorders
- Preferences in artificial intelligence
- Expected utility with nonlinear threshold
- On the interval number of a chordal graph
- Continuum limits for classical sequential growth models
- Homogeneously Representable Interval Bigraphs
- Counting interval orders
- Semiorders and the 1/3-2/3 conjecture
- Tangent circle graphs and `orders'
- INTERVAL-VALUED REPRESENTABILITY OF QUALITATIVE DATA: THE CONTINUOUS CASE
- Numerical representation of \(PQI\) interval orders
- Jaco-type graphs and black energy dissipation
- $n!$ matchings, $n!$ posets
- Classes of interval graphs under expanding length restrictions
- Interval digraphs: An analogue of interval graphs
- A valued Ferrers relation for interval comparison
- Normal Helly circular-arc graphs and its subclasses
- How to revise a total preorder
- Embedding mappings and splittings with applications
- Necessary and possible preference structures
- Biorders with frontier
- The fractional weak discrepancy of \((M, 2)\)-free posets
- Upper semicontinuous representations of interval orders
- Nonparametric estimation of the bivariate CDF for arbitrarily censored data
- Interval orders and circle orders
- The dimension of cycle-free orders
- Representations of interval orders on connected separable topological spaces
- Injective envelopes of transition systems and Ferrers languages
- Dimension bounds on classes of interval orders with restricted representation
- A combinatorial study of async/await processes
- Modal preference structures
- Machine learning models, epistemic set-valued data and generalized loss functions: an encompassing approach
- Diversity and dissimilarity in lines and hierarchies
- \(N\)-free orders and minimal interval extensions
- Declawing a graph: polyhedra and branch-and-cut algorithms
- A study on properties of random interval graphs and Erdős Rényi graph 𝒢(n, 2/3)
- Generalization of Portmanteau theorem for a sequence of interval-valued pseudo-probability measures
- A characterization of 2-tree probe interval graphs
- Some Remarks on Approximations of Arbitrary Binary Relations by Partial Orders
- Chain representations of nested families of biorders
- Dimension of CPT posets
- Linear extensions and comparable pairs in partial orders
- Rights revisited, and limited
- Towards interval uncertainty propagation control in bivariate aggregation processes and the introduction of width-limited interval-valued overlap functions
- Interval-valued rank in finite ordered sets
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)
