scientific article; zbMATH DE number 3235858
From MaRDI portal
zbMath0146.20104MaRDI QIDQ5523467
Thomas L. Saaty, Robert G. Busacker
Publication date: 1965
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Uniform and Completely Nonequilibrium Invariant States for Weak Coupling Limit Type Quantum Markov Semigroups Associated with Eulerian Cycles, Zur Berechnung der Verteilung graphentheoretischer Zufallsvariablen, The minimum cost flow problem: A unifying approach to dual algorithms and a new tree-search algorithm, On methods for generating random partial orders, Heuristic and exact algorithms for the spanning tree detection problem, Application of the majority connectedness carrier for computing the reliability of complex systems, Asymptotic behaviour of output feedback for a class of non-deterministic discrete event systems, Homotopy base of acyclic graphs - a combinatorial analysis of commutative diagrams by means of preordered matroid, Some Basic Definitions in Graph Theory, Vertex heaviest paths and cycles in quasi-transitive digraphs, General equilibrium and the theory of directed graphs, Stochastic token theory, A technique for generating interpretive translators for problem-oriented languages, Graph property recognition machines, Solution of a system of simultaneous linear equations with a sparse coefficient matrix by elimination methods, Universality of iterated networks, Some problems in discrete optimization, What is a Graph?, On the Power of Color Refinement, Arbitrarily traceable graphs and digraphs, On maximal independent sets of vertices in claw-free graphs, Sensitivitätsindices für Knoten und Kanten eines Netzes, Pickup and Delivery of Partial Loads with “Soft” Time Windows, SELECT PROPERTIES OF THE GRAPH MODEL OF A GENERAL AUTOMATON, Optimal scaling for arbitrarily ordered categories, Heuristics and their design: A survey, The graph isomorphism problem and approximate categories, A successful concept for measuring non-planarity of graphs: The crossing number., Weighted min cost flows, Cardinality constrained minimum cut problems: complexity and algorithms., A Branch-and-Bound Approach to the Traveling Salesman Problem with a Drone, Applications of graph theory in computer systems, On the Use of a Mixed Integer Non-linear Programming Model for Refrigerant Design, Methods for calculating zero-level instability of electronic circuits under variations in parameters and external disturbances, Constructing a stochastic critical path network given the slacks: Representation, Planning temporal events using point-interval logic, Algorithms for the minimum cost circulation problem based on maximizing the mean improvement, Modeling and algorithmic development of a staff scheduling problem, Frustration and overblocking on graphs, A QoS multicast routing protocol for dynamic group topology, Vector spaces and the four-color problem, Law of the iterated logarithm for sums of non-linear functions of Gaussian variables that exhibit a long range dependence, Properties of a planar cubic graph, Algorithm for deriving the chromatic polynomial of a graph, ANALYSIS OF A GENERAL LOGICAL DISCOURSE FOR MAN‐MACHINE INTERACTION—PART II, Some applications of graph theory to clustering, The number of two-way tables satisfying certain additivity axioms, An introduction to matching polynomials, Properties of a Euler graph, Decentralized control of linear multivariable systems, Unnamed Item, A characterization of nearest-neighbor rule decision surfaces and a new approach to generate them, On The tantalizer and Instant insanity, Graph theory, Algorithm of the method of generalized potentials for problems of the optimum synthesis of communication networks with undefined factors, Algorithm of the generalized method of potentials for the problem of optimal linear synthesis of a communication network, On the temporal analysis of special GERT networks using a modified Markov renewal process, Unnamed Item, Min-Cost Flow in Unit-Capacity Planar Graphs, Decomposition of communication networks, A construction method in parametric programming, A prediction theory for some nonlinear functional-differential equations. I: Learning of lists, A prediction theory for some nonlinear functional-differential equations. II: Learning of patterns, On the global limits and oscillations of a system of nonlinear differential equations describing a flow on a probabilistic network, On Okada's method for realizing cut-set matrices, Convexity in directed graphs, DISCRETE MODEL OF STATIC LOADS DISTRIBUTION MANAGEMENT ON LATTICE STRUCTURES, DEVELOPMENT OF SPECIAL MATHEMATICAL SOFTWARE USING COMBINATORIAL NUMBERS AND LATTICE STRUCTURE ANALYSIS, PARTIALLY ORDERED SETS AND COMBINATORY OBJECTS OF THE PYRAMIDAL STRUCTURE, Application of the algebra of cubic complexes to network reliability analysis, Heuristically guided search and chromosome matching, Path lengths and initial derivatives in arbitrary and Hessenberg compartmental systems, Zum Auswahlproblem, An upper bound for the rectilinear crossing number of the complete graph, Triangulated graphs and the elimination process, A note on optimality conditions for the Euclidean. Multifacility location problem, A problem on lattice graphs. Theory and algorithm, m-ary closed sequences, Enumeration of spanning trees containing given subgraphs, On fully indecomposable matrices, Polyhedral realization in \(R^ 3\) of triangulations of the torus and 2- manifolds in cyclic 4-polytopes, Indirect counting trees in linear graphs, Construction and enumeration of regular maps on the torus, Optimal task sequencing with precedence constraints, Compartmental matrices with single root and nonnegative nilpotent matrices, Vertices missed by longest paths or circuits, Thickness and coarseness of graphs, Matchings and skew-symmetric quadratic forms, A new algorithm for solving the tree isomorphism problem, Some unsymmetric combinatorial numbers, A backtracking algorithm to generate all kernels of a directed graph, Generic properties of column-structured matrices, On cyclic sequence types for constructing cyclic schedules, Irreducible economies and strongly connected graphs, Finding all the negative cycles in a directed graph, Tight bounds on the number of minimum-mean cycle cancellations and related results, Dimension of the Gibbs function topological manifold. I: Graph representation of the thermodynamic equilibrium state
