scientific article; zbMATH DE number 3566474
From MaRDI portal
Publication:4138414
zbMath0363.90002MaRDI QIDQ4138414
Publication date: 1976
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Applications of mathematical programming (90C90) Applications of game theory (91A80) Trade models (91B60) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Genetics and epigenetics (92D10) General biology and biomathematics (92B05) Mathematical sociology (including anthropology) (91D99)
Related Items
On the optimal strongly connected orientations of city street graphs. IV: Four east-west avenues or north-south streets, Interval representations of planar graphs, Intersection graphs of paths in a tree, Optimal patchings for consecutive ones matrices, Size identifiability of compartmental models, Intersection graphs of concatenable subtrees of graphs, On mathematical aspects of analyzing the structure of complex systems using weighted digraphs, On an extremal problem concerning the interval number of a graph, The sensitivity of eigenvalues under elementary matrix perturbations, Two topics in tree inference: locating a phonological network effect in immediate recall and arborescence partitive set form, On pre-periods of discrete influence systems, Finding hidden independent sets in interval graphs, Applications of the theory of meaningfulness to psychology, Reduction in problem size for ranking alternatives in group decision- making, Maximum weight independent sets and cliques in intersection graphs of filaments, Some parallel algorithms on interval graphs, An effective branch-and-price algorithm for the preemptive resource constrained project scheduling problem based on minimal interval order enumeration, On the problem of how to represent a graph taking into account an additional structure, Niche space, multigraphs, and the Helly condition, Intersection graphs of vertex disjoint paths in a tree, Fuzzy intersection graphs, Algorithm for determining the mutual impact of nodes in weighted directed graphs, Dominating sets in social network graphs, A new method (K-method) of calculating the mutual influence of nodes indirected weight complex networks, Gridline indifference graphs, Isomorphism in 3-person games, Characterizations of fuzzy interval graphs, Algorithmic aspects of intersection graphs and representation hypergraphs, Intersection graphs of Helly families of subtrees, Transitivity of fuzzy matrices under generalized connectedness, On the unit interval number of a graph, On dimensional properties of graphs, Modular intersection graphs, Reformulating Markovian processes for learning and memory from a hazard function framework, Satisfiability problems on intervals and unit intervals, A study of Euler resource networks, Algorithms for \(\mathcal{GA}\mathrm{-}\mathcal H\) reduced graphs, Optimal resource allocation in the difference and differential Stackelberg games on marketing networks, Issues of dynamic graph theory, Stability and structure of compartmental models of ecosystems, On the stabilization of iterative processes, Extensions of graph inversion to support an artificially intelligent modeling environment, 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, On optimal orientations of Cartesian products with a bipartite graph, Combined stress and human performance: A weighted digraph model, New sequential and parallel algorithms for interval graph recognition, Two-party graphs and monotonicity properties of the Poincaré mapping, Comparability graphs and intersection graphs, Intersection properties of graphs, Boxicity of circular arc graphs, \((i,j)\) competition graphs, Intersection representations of matrices by subtrees and unicycles on graphs, Impediments to universal preference-based default theories, Minimal obstructions for partial representations of interval graphs, The influence of graph structure on generalized dimension exchange, Axiomatics for power indices in the weighted games, Constructing a stochastic critical path network given the slacks: Representation, Sources in posets and comparability graphs, Minimum weight feedback vertex sets in circle graphs, Passage time, resilience, and structure of compartmental models, Some remarks on conflict analysis, On periodical behaviour in societies with symmetric influences, Analysis of an ecological niche, When are two qualitative taxonomic characters compatible?, Computing the boxicity of a graph by covering its complement by cointerval graphs, Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms, Mutual exclusion scheduling with interval graphs or related classes. I, 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, A necessary but insufficient condition for the stochastic binary choice problem, Preference voting and project ranking using DEA and cross-evaluation, Boxicity of graphs with bounded degree, Representation theorems for graphs whose vertex set is partially ordered, A characterization of cycle-free unit probe interval graphs, Applications of edge coverings by cliques, A mathematical approach on representation of competitions: competition cluster hypergraphs, Some results about the interval number of a graph, On optimal orientations of Cartesian products of graphs. I, Finding Hamiltonian circuits in proper interval graphs, A lower bound for the interval number of a graph, Determining the interval number of a triangle-free graph, On fuzzification of some concepts of graphs, A mathematical analysis of a natural class of partitions of a graph, Synthesizing partial orders given comparability information: Partitive sets and slack in critical path networks, Easy weighted majority games, Interval line graphs, Chronological orderings of interval graphs, Matrix sandwich problems, Some questions of reachability in natural-resource management, The relationship between the threshold dimension of split graphs and various dimensional parameters, Complexity of compartmental models, Eigenvalues and structure of compartmental models, Dominating sets and domatic number of circular arc graphs, Homogeneously representable interval graphs, A folk meta-theorem in the foundations of utility theory, The theorem on planar graphs, Social influence models with ranking alternatives and local election rules, MINIMUM WEIGHT FEEDBACK VERTEX SETS IN CIRCLE n-GON GRAPHS AND CIRCLE TRAPEZOID GRAPHS, Consensus functions and patterns in molecular sequences, On partitioning interval graphs into proper interval subgraphs and related problems, Boxicity of graphs on surfaces, A Dynamic Programming Algorithm To Test A Signed Graph For Balance, Coloration de graphes : fondements et applications, New insights on \(\mathbf{GA}\)-\(\mathbf H\) reduced graphs, Extending partial representations of interval graphs, Minimal Obstructions for Partial Representations of Interval Graphs, Complexity and Stability in Compartmental Models, Probabilistic Inductive Classes of Graphs, On eventual boundedness of Lotka-Volterra ecological systems, Features of modeling and identification of cognitive maps under uncertainty, Interval graphs with side (and size) constraints, Algorithms and complexity of sandwich problems in graphs (extended abstract), Inheritance principle in dynamical systems, Adaptive Control of Impulse Processes in Complex Systems Cognitive Maps with Multirate Coordinates Sampling, Preference structure on alternatives and judges in a group decision problem—a fuzzy approach, Parallel algorithms on interval graphs, Measurement of Biodiversity: Richness and Evenness, 3D-interval-filament graphs, Parallel algorithms on circular-arc 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, The criteria of ultimate boundedness for nonautonomous Lotka-Volterra tree systems, Rectangular Matrices and Signed Graphs, Meaningful and meaningless solutions for cooperative \(n\)-person games, Computer science and decision theory, Chronological orderings of interval digraphs, A characterization of 2-tree probe interval graphs, Large-scale clique cover of real-world networks, Resource network with limited capacity of attractor vertices, Automation of Impulse Processes Control in Cognitive Maps with Multirate Sampling Based on Weights Varying, Partitioning Signed Two-Mode Networks, Algorithms on Subtree Filament Graphs, On optimal orientation of cycle vertex multiplications, Double Semiorders and Double Indifference Graphs, On the Computation of the Competition Number of a Graph, Chronological Orderings of Interval Digraph, ALGORITHMS ON SUBGRAPH OVERLAP GRAPHS, A model of the direct interaction of elements of a tightly coupled system
