scientific article; zbMATH DE number 3877239
From MaRDI portal
Publication:3344239
posetsinterval ordersDimensionalityRepresentationslinearly ordered setsBetweennessIndifference Graphs
Partial orders, general (06A06) Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Research exposition (monographs, survey articles) pertaining to biology (92-02) Total orders (06A05) Graph theory (05Cxx) Research exposition (monographs, survey articles) pertaining to ordered structures (06-02)
Recommendations
- scientific article; zbMATH DE number 4091559
- Orders on intervals over partially ordered sets: extending Allen's algebra and interval graph results.
- Interval \(k\)-graphs and orders
- scientific article; zbMATH DE number 1057882
- Interval graphs and interval orders
- Combinatorial aspects of interval orders and interval graphs
- scientific article; zbMATH DE number 426339
- scientific article; zbMATH DE number 1161251
- The niche graphs of interval orders
- A partial order structure on interval orders
Cited in
(only showing first 100 items - show all)- An improved approximation ratio for the jump number problem on interval orders
- Fixed-parameter algorithms for cochromatic number and disjoint rectangle stabbing via iterative localization
- Integral mixed unit interval graphs
- Unit and proper tube orders
- Cliques that are tolerance digraphs
- Combinatorial aspects of interval orders and interval graphs
- Numerical representation of binary relations with a multiplicative error function
- Recognizing unit multiple intervals is hard
- Representation of ordered structures on the real line: a panoramic view
- A simple optimal algorithm for \(k\)-tuple dominating problem in interval graphs
- The niche graphs of interval orders
- Satisfiability problems on intervals and unit intervals
- Stochastic semi-orders
- Difference ascent sequences and related combinatorial structures
- The longest cycle problem is polynomial on interval graphs
- Reconstruction of finite truncated semi-modular lattices
- Simple inductive proofs of the Fishburn and Mirkin theorem and the Scott-Suppes theorem
- A representation for intransitive indifference relations
- Closure and decision properties for higher-dimensional automata
- An approach to distributed systems from orderings and representability
- Distributed Minimum Vertex Coloring and Maximum Independent Set in Chordal Graphs
- On Embeddability of Unit Disk Graphs onto Straight Lines
- Polynomial time algorithm for k-vertex-edge dominating problem in interval graphs
- Threshold graphs and synchronization protocols
- Inductive characterizations of finite interval orders and semiorders
- Mathematical properties on the hyperbolicity of interval graphs
- Simple Geometrical Intersection Graphs
- On Interval Semantics of Inhibitor and Activator Nets
- Angle orders, regular n-gon orders and the crossing number
- Polynomial time algorithm for \(k\)-vertex-edge dominating problem in interval graphs
- Fractional weak discrepancy and interval orders
- On \(q\)-series identities related to interval orders
- On characterizing proper max-point-tolerance graphs
- Voting procedures, complexity of
- On interval process semantics of Petri nets with inhibitor arcs
- Dimension-2 poset competition numbers and dimension-2 poset double competition numbers
- A new decomposition of ascent sequences and Euler-Stirling statistics
- Representation of preferences over a finite scale by a mean operator
- Fuzzy interval and semi-orders
- Simultaneous representation of interval and interval-containment orders
- Coloring problem of signed interval graphs
- A Model for Birdwatching and other Chronological Sampling Activities
- The interval order polytope of a digraph
- Semiorders and thresholds of utility discrimination: solving the Scott-Suppes representability problem
- A structure theorem for posets admitting a ``strong chain partition: a generalization of a conjecture of Daykin and Daykin (with connections to probability correlation inequalities)
- Fishburn trees
- scientific article; zbMATH DE number 426339 (Why is no real title available?)
- On the classes of interval graphs of limited nesting and count of lengths
- NP-hardness results for the aggregation of linear orders into median orders
- Dynamic voltage scaling under EDF revisited
- A refined analysis on the jump number problem of interval orders
- Presenting interval pomsets with interfaces
- The mathematical psychology of Peter Fishburn
- Interval graphs and interval orders
- Simultaneous dominance representation of multiple posets
- Closure and decision properties for higher-dimensional automata
- What is reconstruction for ordered sets?
- Spherical containment and the Minkowski dimension of partial orders
- Complexity of tree-coloring interval graphs equitably
- Interval approximations of message causality in distributed executions
- Chain dominated orders
- Dimensions of hypergraphs
- Split orders
- Kleene theorem for higher-dimensional automata
- Logic and languages of higher-dimensional automata
- On the thinness and proper thinness of a graph
- Khovanskii bases of subalgebras arising from finite distributive lattices
- Measurement-theoretic justification of connectives in fuzzy set theory
- Hardness and algorithms of equitable tree-coloring problem in chordal graphs
- Efficient pairwise preference elicitation allowing for indifference
- On the directionality of interval orders
- A characterization of unit interval bigraphs of open and closed intervals
- Orders on intervals over partially ordered sets: extending Allen's algebra and interval graph results.
- Preference-based probabilistic planning with partially-ordered temporal goals
- The fractional weak discrepancy of a partially ordered set
- Hyperoctahedral group characters and a type-BC analog of graph coloring
- Width notions for ordering-related problems
- Range of the fractional weak discrepancy function
- Generalizing Roberts' characterization of unit interval graphs
- Refining the bijections among ascent sequences, (2+2)-free posets, integer matrices and pattern-avoiding permutations
- On the non-unit count of interval graphs
- Myhill-Nerode theorem for higher-dimensional automata
- Two-count interval representation of a permutation
- Choosing among maximals
- Proper and unit bitolerance orders and graphs
- Continuous representability of semiorders
- Utility representation via additive or multiplicative error functions.
- Existence of approximate social welfare
- Rough set approach to multiple criteria classification with imprecise evaluations and assignments
- Application of graph theory to topology generation for logic gates
- A simple linear time algorithm to solve the MIST problem on interval graphs
- Sampling dynamic networks with application to investigation of HIV epidemic drivers
- The graph of critical pairs of a crown
- Functional specification and proof of correctness for time dependent behaviour of reactive systems
- Multicriterial interval choice models
- Norbert Wiener on the theory of measurement (1914, 1915, 1921)
- Obituary: Peter C. Fishburn (1936--2021)
- Peter C. Fishburn (1936--2021)
- Max point-tolerance graphs
- Fractional dimension of partial orders
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3344239)