scientific article; zbMATH DE number 3566474

Publication date 1976

Applications of mathematical programming (90C90) Genetics and epigenetics (92D10) Applications of game theory (91A80) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Mathematical sociology (including anthropology) (91D99) General biology and biomathematics (92B05) Trade models (91B60)

Cited in

(only showing first 100 items - show all)

Two-party graphs and monotonicity properties of the Poincaré mapping
On the unit interval number of a graph
Intersection graphs of vertex disjoint paths in a tree
A Dynamic Programming Algorithm To Test A Signed Graph For Balance
On the Computation of the Competition Number of a Graph
When are two qualitative taxonomic characters compatible?
Complexity and Stability in Compartmental Models
The asymptotic probability that a random graph is a unit interval graph, indifference graph, or proper interval graph
Extensions of graph inversion to support an artificially intelligent modeling environment
New sequential and parallel algorithms for interval graph recognition
A lower bound for the interval number of a graph
Algorithmic aspects of intersection graphs and representation hypergraphs
The criteria of ultimate boundedness for nonautonomous Lotka-Volterra tree systems
New insights on \(\mathbf{GA}\)-\(\mathbf H\) reduced graphs
Determining the interval number of a triangle-free graph
A mathematical analysis of a natural class of partitions of a graph
A characterization of 2-tree probe interval graphs
Axiomatics for power indices in the weighted games
Boxicity of graphs on surfaces
On dimensional properties of graphs
Intersection representations of matrices by subtrees and unicycles on graphs
Interval line graphs
Some questions of reachability in natural-resource management
On partitioning interval graphs into proper interval subgraphs and related problems
Eigenvalues and structure of compartmental models
Stability and structure of compartmental models of ecosystems
Dominating sets in social network graphs
A folk meta-theorem in the foundations of utility theory
Measurement of biodiversity: richness and evenness
Computer science and decision theory
The median procedure in cluster analysis and social choice theory
The theorem on planar graphs
Social influence models with ranking alternatives and local election rules
Applications of edge coverings by cliques
Minimal obstructions for partial representations of interval graphs
3D-interval-filament graphs
Intersection properties of graphs
On pre-periods of discrete influence systems
On mathematical aspects of analyzing the structure of complex systems using weighted digraphs
Size identifiability of compartmental models
The sensitivity of eigenvalues under elementary matrix perturbations
The influence of graph structure on generalized dimension exchange
Coloration de graphes : fondements et applications
Optimal resource allocation in the difference and differential Stackelberg games on marketing networks
Algorithms on subgraph overlap graphs
Reduction in problem size for ranking alternatives in group decision- making
Preference structure on alternatives and judges in a group decision problem—a fuzzy approach
Minimal obstructions for partial representations of interval graphs
Dynamic resource allocation networks in marketing: comparing the effectiveness of control methods
Reformulating Markovian processes for learning and memory from a hazard function framework
Chronological Orderings of Interval Digraph
Inheritance principle in dynamical systems
Sources in posets and comparability graphs
Periodic, irreducible, powerful ray pattern matrices
Characterizations of fuzzy interval graphs
On eventual boundedness of Lotka-Volterra ecological systems
Satisfiability problems on intervals and unit intervals
Probabilistic Inductive Classes of Graphs
On the problem of how to represent a graph taking into account an additional structure
Parallel algorithms on interval graphs
Minimum weight feedback vertex sets in circle \(n\)-gon graphs and circle trapezoid graphs
Passage time, resilience, and structure of compartmental models
Mutual exclusion scheduling with interval graphs or related classes. I
A new method (K-method) of calculating the mutual influence of nodes indirected weight complex networks
Fuzzy intersection graphs
Minimum weight feedback vertex sets in circle graphs
Chronological orderings of interval graphs
On an extremal problem concerning the interval number of a graph
A note on lower bounds for boxicity of graphs
Rectangular Matrices and Signed Graphs
Computing the boxicity of a graph by covering its complement by cointerval graphs
Algorithms on Subtree Filament Graphs
Boxicity of circular arc graphs
Double Semiorders and Double Indifference Graphs
Features of modeling and identification of cognitive maps under uncertainty
Two topics in tree inference: locating a phonological network effect in immediate recall and arborescence partitive set form
Choice procedure in fuzzy multicriteria decision analysis based on pairwise comparisons
Algorithms and complexity of sandwich problems in graphs (extended abstract)
Consensus functions and patterns in molecular sequences
On optimal orientations of Cartesian products of graphs. I
Matrix sandwich problems
Finding Hamiltonian circuits in proper interval graphs
Optimal patchings for consecutive ones matrices
Intersection graphs of paths in a tree
On optimal orientation of cycle vertex multiplications
Boxicity of graphs with bounded degree
Finding hidden independent sets in interval graphs
Comparability graphs and intersection graphs
Transitivity of fuzzy matrices under generalized connectedness
Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
On the optimal strongly connected orientations of city street graphs. IV: Four east-west avenues or north-south streets
Parallel algorithms on circular-arc graphs
Large-scale clique cover of real-world networks
Intersection graphs of concatenable subtrees of graphs
Maximum weight independent sets and cliques in intersection graphs of filaments
Homogeneously representable interval graphs
Synthesizing partial orders given comparability information: Partitive sets and slack in critical path networks
Analysis of an ecological niche
A necessary but insufficient condition for the stochastic binary choice problem
Easy weighted majority games

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)