scientific article; zbMATH DE number 3877239
zbMATH Open0551.06001MaRDI QIDQ3344239FDOQ3344239
Publication date: 1985
Title of this publication is not available (Why is that?)
Recommendations
- scientific article
- 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
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)
Cited In (only showing first 100 items - show all)
- Combinatorial aspects of interval orders and interval graphs
- Unit and proper tube orders
- 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
- The niche graphs of interval orders
- Satisfiability problems on intervals and unit intervals
- Simple Geometrical Intersection Graphs
- Inductive characterizations of finite interval orders and semiorders
- Angle orders, regular n-gon orders and the crossing number
- Fractional weak discrepancy and interval orders
- On \(q\)-series identities related to interval orders
- Extending partial representations of interval graphs
- Dimension-2 poset competition numbers and dimension-2 poset double competition numbers
- Fuzzy interval and semi-orders
- The interval order polytope of a digraph
- Simultaneous representation of interval and interval-containment orders
- Representation of preferences over a finite scale by a mean operator
- Semiorders and thresholds of utility discrimination: solving the Scott-Suppes representability problem
- Title not available (Why is that?)
- 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)
- 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
- Interval graphs and interval orders
- Simultaneous dominance representation of multiple posets
- What is reconstruction for ordered sets?
- Spherical containment and the Minkowski dimension of partial orders
- Chain dominated orders
- Dimensions of hypergraphs
- Split orders
- On the thinness and proper thinness of a graph
- Measurement-theoretic justification of connectives in fuzzy set theory
- On the directionality of interval orders
- On Interval Process Semantics of Petri Nets with Inhibitor Arcs
- Orders on intervals over partially ordered sets: extending Allen's algebra and interval graph results.
- The fractional weak discrepancy of a partially ordered set
- Range of the fractional weak discrepancy function
- Refining the bijections among ascent sequences, (2+2)-free posets, integer matrices and pattern-avoiding permutations
- On the non-unit count of interval graphs
- Unit Interval Graphs of Open and Closed Intervals
- Proper and unit bitolerance orders and graphs
- Choosing among maximals
- Utility representation via additive or multiplicative error functions.
- Existence of approximate social welfare
- Continuous representability of semiorders
- Rough set approach to multiple criteria classification with imprecise evaluations and assignments
- Sampling dynamic networks with application to investigation of HIV epidemic drivers
- Multicriterial interval choice models
- Interval graphs with side (and size) constraints
- SCHEDULING INTERVAL ORDERS IN PARALLEL
- Languages of higher-dimensional automata
- Functional specification and proof of correctness for time dependent behaviour of reactive systems
- Norbert Wiener on the theory of measurement (1914, 1915, 1921)
- Fractional dimension of partial orders
- Max point-tolerance graphs
- Non-empty cross-2-intersecting families of subsets
- A generalization of Moulin's Pareto extension theorem
- Mixed unit interval graphs
- Catalan pairs and Fishburn triples
- Counting general and self-dual interval orders
- Voting Procedures, Complexity of
- Copulae of probability measures on product spaces
- Maximizing an interval order on compact subsets of its domain
- Equidistributed statistics on Fishburn matrices and permutations
- Min-max decision rules for choice under complete uncertainty: axiomatic characterizations for preferences over utility intervals
- Studying interval valued matrix games with fuzzy logic
- A genesis of interval orders and semiorders: transitive NaP-preferences
- Integral mixed unit interval graphs
- Representations of graphs and networks (coding, layouts and embeddings)
- Cliques that are tolerance digraphs
- Numerical representation of binary relations with a multiplicative error function
- A simple optimal algorithm for \(k\)-tuple dominating problem in interval graphs
- Stochastic semi-orders
- An approach to distributed systems from orderings and representability
- Threshold graphs and synchronization protocols
- Distributed Minimum Vertex Coloring and Maximum Independent Set in Chordal Graphs
- The longest cycle problem is polynomial on interval graphs
- On Embeddability of Unit Disk Graphs onto Straight Lines
- A representation for intransitive indifference relations
- Reconstruction of finite truncated semi-modular lattices
- Simple inductive proofs of the Fishburn and Mirkin theorem and the Scott-Suppes theorem
- On Interval Semantics of Inhibitor and Activator Nets
- Polynomial time algorithm for \(k\)-vertex-edge dominating problem in interval graphs
- Polynomial time algorithm for \(k\)-vertex-edge dominating problem in interval graphs
- Mathematical properties on the hyperbolicity of interval graphs
- On characterizing proper max-point-tolerance graphs
- A new decomposition of ascent sequences and Euler-Stirling statistics
- Coloring problem of signed interval graphs
- A Model for Birdwatching and other Chronological Sampling Activities
- Fishburn trees
- The mathematical psychology of Peter Fishburn
- A refined analysis on the jump number problem of interval orders
- Closure and decision properties for higher-dimensional automata
- Interval approximations of message causality in distributed executions
- Complexity of tree-coloring interval graphs equitably
- Hardness and algorithms of equitable tree-coloring problem in chordal graphs
- A characterization of unit interval bigraphs of open and closed intervals
- Efficient pairwise preference elicitation allowing for indifference
- Myhill-Nerode theorem for higher-dimensional automata
- Application of graph theory to topology generation for logic gates
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)