scientific article; zbMATH DE number 3566474
From MaRDI portal
Publication:4138414
Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Applications of mathematical programming (90C90) Applications of game theory (91A80) Trade models (91B60) Mathematical sociology (including anthropology) (91D99) General biology and biomathematics (92B05) Genetics and epigenetics (92D10)
Cited in
(only showing first 100 items - show all)- Mutual exclusion scheduling with interval graphs or related classes. I
- Boxicity of graphs with bounded degree
- A characterization of cycle-free unit probe interval graphs
- Finding Hamiltonian circuits in proper interval graphs
- Determining the interval number of a triangle-free graph
- A mathematical analysis of a natural class of partitions of a graph
- Complexity of compartmental models
- Eigenvalues and structure of compartmental models
- Dominating sets and domatic number of circular arc graphs
- Homogeneously representable interval graphs
- The theorem on planar graphs
- Social influence models with ranking alternatives and local election rules
- Interval representations of planar graphs
- Intersection graphs of paths in a tree
- Size identifiability of compartmental models
- On an extremal problem concerning the interval number of a graph
- The sensitivity of eigenvalues under elementary matrix perturbations
- On pre-periods of discrete influence systems
- Applications of the theory of meaningfulness to psychology
- Reduction in problem size for ranking alternatives in group decision- making
- Some parallel algorithms on interval graphs
- On the problem of how to represent a graph taking into account an additional structure
- Fuzzy intersection graphs
- Dominating sets in social network graphs
- Algorithmic aspects of intersection graphs and representation hypergraphs
- Transitivity of fuzzy matrices under generalized connectedness
- On the unit interval number of a graph
- On dimensional properties of graphs
- Stability and structure of compartmental models of ecosystems
- On the stabilization of iterative processes
- The median procedure in cluster analysis and social choice theory
- The asymptotic probability that a random graph is a unit interval graph, indifference graph, or proper interval graph
- Combined stress and human performance: A weighted digraph model
- Comparability graphs and intersection graphs
- Intersection properties of graphs
- \((i,j)\) competition graphs
- Impediments to universal preference-based default theories
- Constructing a stochastic critical path network given the slacks: Representation
- When are two qualitative taxonomic characters compatible?
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- A fuzzy relation space for group decision theory
- A recognition algorithm for the intersection graphs of paths in trees
- Optimal parallel algorithms on circular-arc graphs
- Choice procedure in fuzzy multicriteria decision analysis based on pairwise comparisons
- Preference voting and project ranking using DEA and cross-evaluation
- On fuzzification of some concepts of graphs
- Matrix sandwich problems
- On the optimal strongly connected orientations of city street graphs. IV: Four east-west avenues or north-south streets
- Intersection graphs of concatenable subtrees of graphs
- Satisfiability problems on intervals and unit intervals
- On optimal orientations of Cartesian products of graphs. I
- Easy weighted majority games
- A necessary but insufficient condition for the stochastic binary choice problem
- Finding hidden independent sets in interval graphs
- Niche space, multigraphs, and the Helly condition
- Intersection graphs of vertex disjoint paths in a tree
- Isomorphism in 3-person games
- Characterizations of fuzzy interval graphs
- Intersection graphs of Helly families of subtrees
- Modular intersection graphs
- On optimal orientations of Cartesian products with a bipartite graph
- Optimal patchings for consecutive ones matrices
- Algorithm for determining the mutual impact of nodes in weighted directed graphs
- A new method (K-method) of calculating the mutual influence of nodes indirected weight complex networks
- Optimal resource allocation in the difference and differential Stackelberg games on marketing networks
- Passage time, resilience, and structure of compartmental models
- On periodical behaviour in societies with symmetric influences
- Computer science and decision theory
- Large-scale clique cover of real-world networks
- Resource network with limited capacity of attractor vertices
- A model of the direct interaction of elements of a tightly coupled system
- Consensus functions and patterns in molecular sequences
- Boxicity of graphs on surfaces
- New insights on \(\mathbf{GA}\)-\(\mathbf H\) reduced graphs
- Inheritance principle in dynamical systems
- 3D-interval-filament graphs
- Mutual exclusion scheduling with interval graphs or related classes. II
- Periodic, irreducible, powerful ray pattern matrices
- From the discrete to the continuous: Relationships and results for single-species population models
- Chronological orderings of interval digraphs
- A characterization of 2-tree probe interval graphs
- On optimal orientation of cycle vertex multiplications
- Two topics in tree inference: locating a phonological network effect in immediate recall and arborescence partitive set form
- Algorithms on subgraph overlap graphs
- Minimum weight feedback vertex sets in circle n-gon graphs and circle trapezoid graphs
- Minimal obstructions for partial representations of interval graphs
- Maximum weight independent sets and cliques in intersection graphs of filaments
- Adaptive control of impulse processes in complex systems cognitive maps with multirate coordinates sampling
- Rectangular Matrices and Signed Graphs
- On partitioning interval graphs into proper interval subgraphs and related problems
- An effective branch-and-price algorithm for the preemptive resource constrained project scheduling problem based on minimal interval order enumeration
- Complexity and Stability in Compartmental Models
- Measurement of biodiversity: richness and evenness
- Partitioning Signed Two-Mode Networks
- Chronological Orderings of Interval Digraph
- Probabilistic Inductive Classes of Graphs
- Algorithms on Subtree Filament Graphs
- Double Semiorders and Double Indifference Graphs
- Preference structure on alternatives and judges in a group decision problem—a fuzzy approach
- Reformulating Markovian processes for learning and memory from a hazard function framework
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 Q4138414)