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)- Fast-mixed searching and related problems on graphs
- Normal Helly circular-arc graphs and its subclasses
- Interval dimension and MacNeille completion
- Convex and extendable partitions of a lattice
- A characterization of uniquely representable interval graphs
- Combinatorial aspects of interval orders and interval graphs
- Uniquely orderable interval graphs
- Embedding mappings and splittings with applications
- Linear extensions and comparable pairs in partial orders
- Counting endpoint sequences for interval orders and interval graphs
- Bounded discrete representations of interval orders
- The limit of \(\operatorname{split}_n\)-language equivalence
- Sign types associated to posets
- Nonparametric estimation of the bivariate CDF for arbitrarily censored data
- How to revise a total preorder
- Paradoxes of two-length interval orders
- Angle orders
- Media theory
- Generalization of Portmanteau theorem for a sequence of interval-valued pseudo-probability measures
- scientific article; zbMATH DE number 91750 (Why is no real title available?)
- Finite dimensional scattered posets
- Minimizing bumps in linear extensions of ordered sets
- Interval traces with mutex relation
- Mutual exclusion scheduling with interval graphs or related classes. I
- Chronological orderings of interval graphs
- scientific article; zbMATH DE number 6280457 (Why is no real title available?)
- scientific article; zbMATH DE number 4091559 (Why is no real title available?)
- Unified representability of total preorders and interval orders through a single function: the lattice approach
- 3-interval irreducible partially ordered sets
- Bipolar preference modeling and aggregation in decision support
- Tangent circle graphs and `orders'
- Extended formulations for order polytopes through network flows
- Utility representation of an incomplete preference relation
- scientific article; zbMATH DE number 1554929 (Why is no real title available?)
- Generation and enumeration of some classes of interval orders
- Some progress on the Aharoni-Korman conjecture
- Evaluations of Hecke algebra traces at Kazhdan-Lusztig basis elements
- To reorient is easier than to orient: An on-line algorithm for reorientation of graphs
- Revealed preference and intransitive indifference
- Graphs of interval count two with a given partition
- Continuum limits for classical sequential growth models
- INTERVAL-VALUED REPRESENTABILITY OF QUALITATIVE DATA: THE CONTINUOUS CASE
- Approximations of arbitrary relations by partial orders
- From set relations to belief function relations
- Preference structures and threshold models
- Two problems on interval counting
- The dimension of cycle-free orders
- On embeddability of unit disk graphs onto straight lines
- scientific article; zbMATH DE number 5556718 (Why is no real title available?)
- On the classes of interval graphs of limited nesting and count of lengths
- A combinatorial study of async/await processes
- Modal preference structures
- Interval orders, semiorders and ordered groups
- A bi-preference interplay between transitivity and completeness: reformulating and extending Schmeidler's theorem
- MaxCut on permutation graphs is NP‐complete
- Towards interval uncertainty propagation control in bivariate aggregation processes and the introduction of width-limited interval-valued overlap functions
- Limited Rights as Partial Veto and Sen’s Impossibility Theorem
- On the Interval Number of a Triangulated Graph
- Injective envelopes of transition systems and Ferrers languages
- Any complete preference structure without circuit admits an interval representation
- The fractional weak discrepancy of \((M, 2)\)-free posets
- Tractabilities and intractabilities on geometric intersection graphs
- Circle orders and angle orders
- A representation of interval orders through a bi-utility function
- Numerical representation of PQI interval orders
- Interval orders and circle orders
- Strict \((m, 1)\)-Ferrers properties
- Lexicographic aggregation of semiorders
- Congruences for the Fishburn numbers
- Utility with fuzzy numbers
- (m, n)-rationalizable choices
- Universal semiorders
- Preferences in artificial intelligence
- On representing an interval graph using the minimum number of interval lengths
- Aggregation of semiorders: Intransitive indifference makes a difference
- Chain representations of nested families of biorders
- The pseudo-transitivity of preference relations: strict and weak \((m,n)\)-Ferrers properties
- Necessary and possible indifferences
- Stochastic dominance with imprecise information
- Paul Erdős, 1913-1996
- 2-nested matrices: towards understanding the structure of circle graphs
- The interplay between transitivity and completeness: generalized \textsf{NaP}-preferences
- Tackling the jump number of interval orders
- Rational choice with status quo bias
- Declawing a graph: polyhedra and branch-and-cut algorithms
- Interval semantics for Petri nets with inhibitor arcs
- Continuous semiorder representations
- Linear extension majority cycles on partial orders
- Weakened transitive rationality: invariance of numerical representations of preferences
- Dimension of CPT posets
- Koszul binomial edge ideals of pairs of graphs
- Congruence relations on a choice space
- A probabilistic framework for the design of instance-based supervised ranking algorithms in an ordinal setting
- Nontransitive preferences in decision theory
- Preference Structures and Co-comparability Graphs
- A general concept of scoring rules: general definitions, statistical inference, and empirical illustrations
- scientific article; zbMATH DE number 3877239 (Why is no real title available?)
- Rights revisited, and limited
- Norbert Wiener on the theory of measurement (1914, 1915, 1921)
- Peter C. Fishburn (1936--2021)
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)
