Interval graphs and interval orders
From MaRDI portal
Publication:1060230
DOI10.1016/0012-365X(85)90042-1zbMath0568.05047WikidataQ105709725 ScholiaQ105709725MaRDI QIDQ1060230
Publication date: 1985
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items
Media theory, Minimizing bumps in linear extensions of ordered sets, Detecting causal relationships in distributed computations: In search of the holy grail, Stochastic dominance with imprecise information, Evaluations of Hecke algebra traces at Kazhdan-Lusztig basis elements, 3-interval irreducible partially ordered sets, Two problems on interval counting, Unified representability of total preorders and interval orders through a single function: the lattice approach, Aggregation of semiorders: Intransitive indifference makes a difference, Generation and enumeration of some classes of interval orders, \((m, n)\)-rationalizable choices, Universal semiorders, Preferences in artificial intelligence, Uniquely orderable interval graphs, Counting interval orders, Continuous semiorder representations, Approximations of arbitrary relations by partial orders, Strict \((m, 1)\)-Ferrers properties, A general concept of scoring rules: general definitions, statistical inference, and empirical illustrations, Database querying under changing preferences, 2-nested matrices: towards understanding the structure of circle graphs, The interplay between transitivity and completeness: generalized \textsf{NaP}-preferences, Any complete preference structure without circuit admits an interval representation, Interval orders and circle orders, Algorithmic aspects of intersection graphs and representation hypergraphs, Fast-mixed searching and related problems on graphs, The pseudo-transitivity of preference relations: strict and weak \((m,n)\)-Ferrers properties, Congruence relations on a choice space, Interval-valued rank in finite ordered sets, Continuous representations of interval orders by means of two continuous functions, Necessary and possible indifferences, Diversity and dissimilarity in lines and hierarchies, A \textit{branch} \& \textit{price} algorithm for the minimum cost clique cover problem in max-point tolerance graphs, Congruences for the Fishburn numbers, Critically prime orders, A bi-preference interplay between transitivity and completeness: reformulating and extending Schmeidler's theorem, Biorders with frontier, Necessary and possible preference structures, Normal Helly circular-arc graphs and its subclasses, Circle orders and angle orders, Finite dimensional scattered posets, Interval graph limits, Min-max decision rules for choice under complete uncertainty: axiomatic characterizations for preferences over utility intervals, Upper semicontinuous representations of interval orders, Counting general and self-dual interval orders, Revealed preference and intransitive indifference, Asymptotics and statistics on Fishburn matrices and their generalizations, Tackling the jump number of interval orders, Extended formulations for order polytopes through network flows, Tractabilities and intractabilities on geometric intersection graphs, Minimal obstructions for partial representations of interval graphs, Equidistributed statistics on Fishburn matrices and permutations, Catalan pairs and Fishburn triples, On the classes of interval graphs of limited nesting and count of lengths, Parallel interval order recognition and construction of interval representations, Norbert Wiener on the theory of measurement (1914, 1915, 1921), Unit representation of semiorders. I: Countable sets, Unit representation of semiorders. II: The general case, Interval semantics for Petri nets with inhibitor arcs, Jónsson posets, Planar lattices are lexicographically shellable, An obvious proof of Fishburn's interval order theorem, Counting endpoint sequences for interval orders and interval graphs, Jaco-type graphs and black energy dissipation, Bounded discrete representations of interval orders, A valued Ferrers relation for interval comparison, How to revise a total preorder, \(N\)-free orders and minimal interval extensions, Utility representation of an incomplete preference relation, Embedding mappings and splittings with applications, Numerical representation of \(PQI\) interval orders, The lattice of strict completions of a finite poset., Graphs of interval count two with a given partition, Rational choice with status quo bias, 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, Linear extensions and comparable pairs in partial orders, From set relations to belief function relations, A characterization of 2-tree probe interval graphs, Koszul binomial edge ideals of pairs of graphs, Handling imprecise evaluations in multiple criteria decision aiding and robust ordinal regression by \(n\)-point intervals, Mutual exclusion scheduling with interval graphs or related classes. I, Declawing a graph: polyhedra and branch-and-cut algorithms, The dimension of cycle-free orders, Simultaneous consecutive ones submatrix and editing problems: classical complexity and fixed-parameter tractable results, Sign types associated to posets, Minimal representation of a semiorder, Linear extension majority cycles on partial orders, Hereditary semiorders and enumeration of semiorders by dimension, Angle orders, Semiorders and the 1/3-2/3 conjecture, New types of aggregation functions for interval-valued fuzzy setting and preservation of pos-\(B\) and nec-\(B\)-transitivity in decision making problems, Generalization of Portmanteau theorem for a sequence of interval-valued pseudo-probability measures, Interval orders, semiorders and ordered groups, Preference through indifference: A topological approach, A note on reference-dependent choice with threshold representation, Interval dimension and MacNeille completion, INTERVAL-VALUED REPRESENTABILITY OF QUALITATIVE DATA: THE CONTINUOUS CASE, Expected utility with nonlinear threshold, A study on properties of random interval graphs and Erdős Rényi graph 𝒢(n, 2/3), Unnamed Item, Routing and scheduling for energy and delay minimization in the powerdown model, Dimension of CPT posets, A Characterization of Mixed Unit Interval Graphs, Generating Posets Beyond N, On embeddability of unit disk graphs onto straight lines, MaxCut on permutation graphs is NP‐complete, Utility with fuzzy numbers, Asymptotics and statistics on Fishburn matrices: Dimension distribution and a conjecture of Stoimenow, Towards interval uncertainty propagation control in bivariate aggregation processes and the introduction of width-limited interval-valued overlap functions, Bi-symmetric multiple equidistributions on ascent sequences, Maximum cut on interval graphs of interval count four is NP-complete, A combinatorial study of async/await processes, A representation of interval orders through a bi-utility function, Modal preference structures, Lexicographic aggregation of semiorders, Preference structures and threshold models, The fractional weak discrepancy of $(M, 2)$-free posets, Weakened Transitive Rationality: Invariance of Numerical Representations of Preferences, Bipolar preference modeling and aggregation in decision support, On the interval number of a chordal graph, On the Interval Number of a Triangulated Graph, Open Questions in Utility Theory, Representations of Interval Orders on Connected Separable Topological Spaces, Searching for a Debreu’s Open Gap Lemma for Semiorders, A Note on Candeal and Induráin’s Semiorder Separability Condition, Chain Representations of Nested Families of Biorders, Some Remarks on Approximations of Arbitrary Binary Relations by Partial Orders, Injective envelopes of transition systems and Ferrers languages, Paul Erdős, 1913-1996, Algebraic Representation, Dualities and Beyond, Classes of interval graphs under expanding length restrictions, The limit of splitn-language equivalence, Interval digraphs: An analogue of interval graphs, Rights Revisited, and Limited, Continuum limits for classical sequential growth models, Dyck paths and positroids from unit interval orders, Dyck paths and positroids from unit interval orders, Extremal interval graphs, Peter C. Fishburn (1936--2021), $n!$ matchings, $n!$ posets, Nonparametric estimation of the bivariate CDF for arbitrarily censored data, UNIVERSAL CODOMAINS TO REPRESENT INTERVAL ORDERS, An ordered examination of influence diagrams, Unnamed Item, Algebraic Structure of Step Traces and Interval Traces, Cycle transversals in bounded degree graphs, Limited Rights as Partial Veto and Sen’s Impossibility Theorem, Unnamed Item, To reorient is easier than to orient: An on-line algorithm for reorientation of graphs, Homogeneously Representable Interval Bigraphs, Preference Structures and Co-comparability Graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Interval lengths for interval orders: A minimization problem
- A characterization of uniquely representable interval graphs
- Restricted thresholds for interval orders: A case of nonaxiomatizability by a universal sentence
- Aspects of semiorders within interval orders
- Paradoxes of two-length interval orders
- Intransitive indifference with unequal indifference intervals
- Foundational aspects of theories of measurement
- Representation of a finite graph by a set of intervals on the real line
- Threshold-Bounded Interval Orders and a Theory of Picycles
- Counting Interval Graphs
- Maximum Semiorders in Interval Orders
