scientific article; zbMATH DE number 3299758

Publication date: 1968

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

linear programming dynamic programming graphs block designs matching theory optimization techniques transport networks enumerative combinatorial analysis

Mathematics Subject Classification ID

Linear programming (90C05) Deterministic network models in operations research (90B10) Dynamic programming (90C39) Other designs, configurations (05B30) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Matching models (91B68) Graph theory (05Cxx) Enumerative combinatorics (05Axx)

Related Items

The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs, On the Complexity of Broadcast Domination and Multipacking in Digraphs, Exact probability of fixed patterns occurring in a random sequence, On the domination of the products of graphs II: Trees, Generating all permutations by context-free grammars in Chomsky normal form, The most reliable series-parallel networks, An identity involving derangement numbers and Bell numbers, Generating all permutations by context-free grammars in Greibach normal form, An analysis of self-diagnosis model by conditional fault set, An algebraic measure of complexity, Symbolic derivation of Runge-Kutta order conditions, Balloting Labelling and Personnel Assignment, Non-random shuffling strategies in blackjack, Controllability and the theory of economic policy: a structural approach, Stable matching with special preference patterns, Maximum length codes and their relation with the incomplete block design, A note on constant weight cyclic codes, A study of complexity transitions on the asymmetric traveling salesman problem, Automorphisms and derivations of incidence algebras, Porous exponential domination number of some graphs, Generate all maximal independent sets in permutation graphs, Listing the bonds of a graph in \(\widetilde{O} (n)\)-delay, Iterative algorithms for generating minimal cutsets in directed graphs, On data retrieval from unambiguous bit matrices, DOMINATION AND EDGE DOMINATION IN TREES, Unnamed Item, Unnamed Item, Evolving Perfect Hash Families: A Combinatorial Viewpoint of Evolving Secret Sharing, Realistic versus Rational Secret Sharing, MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability, An optimal algorithm to find minimum k-hop dominating set of interval graphs, Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification, Dominating 2-broadcast in graphs: Complexity, bounds and extremal graphs, Maximum flow in probabilistic graphs-the discrete case, An algorithm for the longest cycle problem, Two algorithms for determining a minimum independent dominating set, The structure of stratified systems and the structure of mobility: A first approximation to a structural theory of vertical mobility, A Property of a Class of Nonlinear Difference Equations, Macmahon's partition analysis IX:K-gon partitions, A study of a generalization of a card problem, Generating a mixed mesh of hexahedra, pentahedra and tetrahedra from an underlying tetrahedral mesh, Constructive graph labeling using double cosets, The design and analysis of an efficient load balancing algorithm employing the symmetric balanced incomplete block design, REPEATED BURST ERROR CORRECTING LINEAR CODES, On the independence ratio of a graph, Sports tournaments, home-away assignments, and the break minimization problem, Network topology and integral multicommodity flow problems, Towards a theory of domination in graphs, On the broadcast domination number of permutation graphs, What is the Future of Cryptography?, Lattice-based identity-based resplittable threshold public key encryption scheme, Strict-sense nonblocking conditions for the \(\log_2 N - 1\) multirate switching fabric for the discrete bandwidth model, Bounds on the sum of broadcast domination number and strong metric dimension of graphs, On the solution of multiattribute problems involving counting in intersecting sets, Mathematical Variables as Indigenous Concepts, Duality relationships between a class of graphs and linear programs, SOME COMBINATORIAL PROPERTIES OF THE SYMMETRIC MONOID, QUANTUM KALEIDOSCOPES AND BELL'S THEOREM, An optimal algorithm to find minimum k-hop connected dominating set of permutation graphs, Bestimmung eines maximalen Matching in beliebigen Graphen, Nonisomorphic Steiner triple systems, Heuristic Assignments of Redundant Software Versions and Processors in Fault-tolerant Computer Systems for Maximum Reliability, Combinatorial results for semigroups of order-preserving or order-reversing subpermutations, Covering Regions by Rectangles, The Distribution of Small Gaps Between Successive Primes, Broadcasts in graphs, Fast algorithms for genegrating integer partitions, Doubly-Periodic Sequences and Two-Dimensional Recurrences, Three Identities between Stirling Numbers and the Stabilizing Character Sequence, Combinatorial approach to group hierarchy for stereoskeletons of ligancy 4, An application of Möbius inversion to a problem in topological dynamics, On Detecting Solutions of Polynomial Nonlinear Difference Equations, Generating and counting valid patterns in routes between two points, A mathematical model for mesh's dynamic behavior, A polynomial time solvable instance of the feasible minimum cover problem, An efficient and flexible algorithm for online mining of large itemsets, Micromechanical definition of an entropy for quasi-static deformation of granular materials, On some counting polynomials in chemistry, A graph coloring algorithm for large scale scheduling problems, Computationally efficient bounds for the Catalan numbers, One-node cutsets and the dominating set polytope, A connection between random variables and latin \(k\)-cubes, Optimal broadcast domination in polynomial time, A study of a dice problem, A bibliography on chromatic polynomials, The growth rate and balance of homogeneous tilings in the hyperbolic plane, The \(\varepsilon\)-\(t\)-net problem, Genus distributions for two classes of graphs, A note on the complexity of the asymmetric traveling salesman problem, Enumeration of irreducible binary words, Classification of \(P_{k2}\), Modelling and solving the perfect edge domination problem, On the solution of linear recurrence equations, The total \(\{k\}\)-domatic number of wheels and complete graphs, Inductive reasoning on recursive equations, On a closed form for derangement numbers: an elementary proof, Which graphs occur as \(\gamma\)-graphs?, Complement total unimodularity, Threshold agent networks: An approach to modelling and simulation, The representation of posets and lattices by sets, The multicommodity assignment problem: A network aggregation heuristic, On two theorems of Lenstra, An approximation algorithm dependent on edge-coloring number for minimum maximal matching problem, An expression for the number of equivalence classes of Latin squares under row and column permutations, Representation of graphs, The necessary and sufficient condition for the worst-case male optimal stable matching, Compositional complexity of Boolean functions, Une approche combinatoire des fonctions elliptiques de Jacobi, Complexity of finding k-path-free dominating sets in graphs, A procedure to count the number of planar mechanisms subject to design constraints from kinematic chains, R-domination of block graphs, The design of an efficient load balancing algorithm employing block design, Large deviations for symmetrised empirical measures, Optimal \((t, r)\) broadcasts on the infinite grid, The generalized logit-linear item response model for binary-designed items, Symbolic derivation of order conditions for hybrid Numerov-type methods solving \(y^{\prime\prime} =f(x,y)\), On the complexity of broadcast domination and multipacking In digraphs, Online dominating set, Design of an efficient load balancing algorithm using the symmetric balanced incomplete block design, The cardinality of the collection of maximum independent sets of a functional graph, The weighted maximum independent set problem in permutation graphs, The strict-sense nonblocking multirate \(\log_d(N, 0, p)\) switching network, A geometric derivation of the Irwin-Hall distribution, A note on graphs which have upper irredundance equal to independence, Fault-detection in networks, Static behavior analysis of a mesh system, Enumeration of connected graphs with cut vertices, Non-admissible tracks in Shamirs scheme, Weak minimization of DFA -- an algorithm and applications, Generating functions for mechanism specialization, On enumerating paths of K arcs in unoriented complete graphs, On the distribution of runs of ones in binary strings, Neighborhood search algorithms for guaranteeing optimal traveling salesman tours must be inefficient, An introduction to matching polynomials, The complexity of total edge domination and some related results on trees, Complexity and characterization aspects of edge-related domination for graphs, Simulation-based optimization for discharge/loading operations at a maritime container terminal, An asymptotic evaluation of the cycle index of a symmetric group, Partition of a query set into minimal number of subsets having consecutive retrieval property, Approximate algorithms for some generalized knapsack problems, Automatic solution of a certain class of combinatorial problems, Extremal length and reproducing differentials on Riemann surfaces, Static main storage packing problems, Combinatorial aspects of rectangular non-negative matrices, A generalization of Burnside's combinatorial lemma, Optimum domination in weighted trees, Bounds for the covering number of a graph, A note on the graph isomorphism counting problem, Information loss in three cell-level control techniques for summary tables, Analytic methods applied to a sequence of binomial coefficients, On the measurement of shape, The connectivity of \(Z\)-transformation graphs of perfect matchings of polyominoes, Construction of defining relators for finite groups, Sperner properties for groups and relations, Symbolic derivation of Runge-Kutta-Nyström order conditions, The bank safe problem, The exact number of squares in Fibonacci words, Every regular graph is a quasigroup graph, Principle of inclusion-exclusion on semilattices, Dominating sets for split and bipartite graphs, The combinatorics and extreme value statistics of protein threading, Multidisk file design: An analysis of folding buckets to disks, Coping with known patterns of lies in a search game, Determination of cointegrating rank in fractional systems., A probabilistic PDL, On an algebraic approach to higher dimensional statistical mechanics, Stable marriage and indifference, A representation of the solution of the \(n\)th order linear difference equation with variable coefficients, Algebras in higher-dimensional statistical mechanics -- the exceptional partition (mean field) algebras, Bibliography on domination in graphs and some basic definitions of domination parameters, Minors of quasi 4-connected graphs, Fuzzy colouring of fuzzy graphs