scientific article; zbMATH DE number 3566474
From MaRDI portal
Publication:4138414
zbMATH Open0363.90002MaRDI QIDQ4138414FDOQ4138414
Authors: Fred Roberts
Publication date: 1976
Title of this publication is not available (Why is that?)
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)
- Minimal obstructions for partial representations of interval graphs
- Reformulating Markovian processes for learning and memory from a hazard function framework
- Characterizations of fuzzy interval graphs
- Sources in posets and comparability graphs
- Satisfiability problems on intervals and unit intervals
- Rectangular Matrices and Signed Graphs
- Fuzzy intersection graphs
- Minimum weight feedback vertex sets in circle graphs
- On an extremal problem concerning the interval number of a graph
- Chronological orderings of interval graphs
- Computing the boxicity of a graph by covering its complement by cointerval graphs
- Boxicity of circular arc graphs
- Algorithms and complexity of sandwich problems in graphs (extended abstract)
- Two topics in tree inference: locating a phonological network effect in immediate recall and arborescence partitive set form
- On optimal orientations of Cartesian products of graphs. I
- Matrix sandwich problems
- Finding Hamiltonian circuits in proper interval graphs
- Intersection graphs of paths in a tree
- Boxicity of graphs with bounded degree
- 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
- Intersection graphs of concatenable subtrees of graphs
- Homogeneously representable interval graphs
- Maximum weight independent sets and cliques in intersection graphs of filaments
- Synthesizing partial orders given comparability information: Partitive sets and slack in critical path networks
- Analysis of an ecological niche
- Resource network with limited capacity of attractor vertices
- Complexity of compartmental models
- Constructing a stochastic critical path network given the slacks: Representation
- A fuzzy relation space for group decision theory
- Preference voting and project ranking using DEA and cross-evaluation
- On fuzzification of some concepts of graphs
- An effective branch-and-price algorithm for the preemptive resource constrained project scheduling problem based on minimal interval order enumeration
- Partitioning Signed Two-Mode Networks
- Interval representations of planar graphs
- The relationship between the threshold dimension of split graphs and various dimensional parameters
- On optimal orientations of Cartesian products with a bipartite graph
- On periodical behaviour in societies with symmetric influences
- Chronological orderings of interval digraphs
- A recognition algorithm for the intersection graphs of paths in trees
- From the discrete to the continuous: Relationships and results for single-species population models
- Dominating sets and domatic number of circular arc graphs
- Some remarks on conflict analysis
- A study of Euler resource networks
- Some results about the interval number of a graph
- Representation theorems for graphs whose vertex set is partially ordered
- \((i,j)\) competition graphs
- Impediments to universal preference-based default theories
- Applications of the theory of meaningfulness to psychology
- Intersection graphs of Helly families of subtrees
- A mathematical approach on representation of competitions: competition cluster hypergraphs
- On the unit interval number of a graph
- Two-party graphs and monotonicity properties of the Poincaré mapping
- On the Computation of the Competition Number of a Graph
- Intersection graphs of vertex disjoint paths in a tree
- When are two qualitative taxonomic characters compatible?
- A lower bound for the interval number of a graph
- Algorithmic aspects of intersection graphs and representation hypergraphs
- Boxicity of graphs on surfaces
- Axiomatics for power indices in the weighted games
- 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
- Dominating sets in social network graphs
- Computer science and decision theory
- A folk meta-theorem in the foundations of utility theory
- The median procedure in cluster analysis and social choice theory
- Applications of edge coverings by cliques
- Minimal obstructions for partial representations of interval graphs
- On pre-periods of discrete influence systems
- On mathematical aspects of analyzing the structure of complex systems using weighted digraphs
- The influence of graph structure on generalized dimension exchange
- Dynamic resource allocation networks in marketing: comparing the effectiveness of control methods
- Preference structure on alternatives and judges in a group decision problem—a fuzzy approach
- Chronological Orderings of Interval Digraph
- Reduction in problem size for ranking alternatives in group decision- making
- Inheritance principle in dynamical systems
- Periodic, irreducible, powerful ray pattern matrices
- On eventual boundedness of Lotka-Volterra ecological systems
- Probabilistic Inductive Classes of Graphs
- Parallel algorithms on interval graphs
- Minimum weight feedback vertex sets in circle \(n\)-gon graphs and circle trapezoid graphs
- On the problem of how to represent a graph taking into account an additional structure
- A note on lower bounds for boxicity of graphs
- Passage time, resilience, and structure of compartmental models
- A new method (K-method) of calculating the mutual influence of nodes indirected weight complex networks
- Mutual exclusion scheduling with interval graphs or related classes. I
- Algorithms on Subtree Filament Graphs
- Double Semiorders and Double Indifference Graphs
- Features of modeling and identification of cognitive maps under uncertainty
- Consensus functions and patterns in molecular sequences
- Choice procedure in fuzzy multicriteria decision analysis based on pairwise comparisons
- On optimal orientation of cycle vertex multiplications
- Optimal patchings for consecutive ones matrices
- Finding hidden independent sets in interval graphs
- Parallel algorithms on circular-arc graphs
- Large-scale clique cover of real-world networks
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)