scientific article; zbMATH DE number 3299758

Publication date 1968

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

Mathematics Subject Classification ID

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

Cited in

(only showing first 100 items - show all)

Symbolic derivation of Runge-Kutta-Nyström order conditions
A probabilistic PDL
Generating and counting valid patterns in routes between two points
On some counting polynomials in chemistry
A graph coloring algorithm for large scale scheduling problems
Computationally efficient bounds for the Catalan numbers
Genus distributions for two classes of graphs
Enumeration of irreducible binary words
Classification of \(P_{k2}\)
Inductive reasoning on recursive equations
Complement total unimodularity
The representation of posets and lattices by sets
The multicommodity assignment problem: A network aggregation heuristic
On two theorems of Lenstra
An expression for the number of equivalence classes of Latin squares under row and column permutations
Representation of graphs
Compositional complexity of Boolean functions
Une approche combinatoire des fonctions elliptiques de Jacobi
Complexity of finding k-path-free dominating sets in graphs
R-domination of block graphs
The weighted maximum independent set problem in permutation graphs
Fault-detection in networks
On enumerating paths of K arcs in unoriented complete graphs
Neighborhood search algorithms for guaranteeing optimal traveling salesman tours must be inefficient
An introduction to matching polynomials
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
Analytic methods applied to a sequence of binomial coefficients
On the measurement of shape
The exact number of squares in Fibonacci words
The combinatorics and extreme value statistics of protein threading
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
Minors of quasi 4-connected graphs
A mathematical model for mesh's dynamic behavior
One-node cutsets and the dominating set polytope
A bibliography on chromatic polynomials
The growth rate and balance of homogeneous tilings in the hyperbolic plane
A note on the complexity of the asymmetric traveling salesman problem
On the solution of linear recurrence equations
Threshold agent networks: An approach to modelling and simulation
The design of an efficient load balancing algorithm employing block design
Optimal \((t, r)\) broadcasts on the infinite grid
Online dominating set
A geometric derivation of the Irwin-Hall distribution
Information loss in three cell-level control techniques for summary tables
The connectivity of \(Z\)-transformation graphs of perfect matchings of polyominoes
Sperner properties for groups and relations
The bank safe problem
Every regular graph is a quasigroup graph
Principle of inclusion-exclusion on semilattices
Determination of cointegrating rank in fractional systems.
A connection between random variables and latin \(k\)-cubes
A study of a dice problem
The total \(\{k\}\)-domatic number of wheels and complete graphs
An approximation algorithm dependent on edge-coloring number for minimum maximal matching problem
On the complexity of broadcast domination and multipacking in digraphs
The strict-sense nonblocking multirate \(\log_d(N, 0, p)\) switching network
The complexity of total edge domination and some related results on trees
Complexity and characterization aspects of edge-related domination for graphs
The \(\varepsilon\)-\(t\)-net problem
Modelling and solving the perfect edge domination problem
On a closed form for derangement numbers: an elementary proof
Which graphs occur as \(\gamma\)-graphs?
Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification
Constructive graph labeling using double cosets
On the broadcast domination number of permutation graphs
Strict-sense nonblocking conditions for the \(\log_2 N - 1\) multirate switching fabric for the discrete bandwidth model
Combinatorial approach to group hierarchy for stereoskeletons of ligancy 4
Generating all permutations by context-free grammars in Chomsky normal form
Generating all permutations by context-free grammars in Greibach normal form
MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability
A study of a generalization of a card problem
The design and analysis of an efficient load balancing algorithm employing the symmetric balanced incomplete block design
Sports tournaments, home-away assignments, and the break minimization problem
Bestimmung eines maximalen Matching in beliebigen Graphen
Nonisomorphic Steiner triple systems
Broadcasts in graphs
Fuzzy colouring of fuzzy graphs
An algebraic measure of complexity
Symbolic derivation of Runge-Kutta order conditions
A study of complexity transitions on the asymmetric traveling salesman problem
MacMahon's partition analysis. IX: k-gon partitions
What is the Future of Cryptography?
Lattice-based identity-based resplittable threshold public key encryption scheme
A polynomial time solvable instance of the feasible minimum cover problem
Some combinatorial properties of the symmetric monoid.
scientific article; zbMATH DE number 425392 (Why is no real title available?)
On Detecting Solutions of Polynomial Nonlinear Difference Equations

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 Q5581642)