This is a collection of translations of a variety of papers on discrete mathematics by members of the Moscow Seminar on Discrete Mathematics. This seminar, begun in 1972, was marked by active participation and intellectual ferment. Mathematicians in the USSR often encountered difficulties in publishing, so many interesting results in discrete mathematics remained unknown in the West for some years, and some are unknown even to the present day. To help fill this communication gap, this collection offers papers that were obscurely published and very hard to find. Among the topic covered here are: graph theory, network flow and multicommodity flow, linear programming and combinatorial optimization, matroid theory ad submodular systems, matrix theory and combinatorics, parallel computing, complexity of algorithms, random graphs and statistical mechanics, coding theory, and algebraic combinatorics and group theory.
Reihe
Sprache
Verlagsort
Zielgruppe
Für höhere Schule und Studium
Für Beruf und Forschung
Maße
Höhe: 255 mm
Breite: 180 mm
Gewicht
ISBN-13
978-0-8218-7509-4 (9780821875094)
Copyright in bibliographic data is held by Nielsen Book Services Limited or its licensors: all rights reserved.
Schweitzer Klassifikation
Approximate evaluation of a linear function at the vertices of the unit $n$-dimensional cube by L. G. Babat On the growth of coefficients in an integral linear aggregation by L. G. Babat A fast algorithm for constructing a maximum flow through a network by B. V. Cherkasskii On the extremality of the rank function of a connected semimodular lattice by V. P. Grishukhin On polynomial solvability conditions for the simplest plant location problem by V. P. Grishukhin Minimal mean weight cuts and cycles in directed graphs by A. V. Karzanov An algorithm for determining a maximum packing of odd-terminus cuts, and its applications by A. V. Karzanov Maximum- and minimum-cost multicommodity flow problems having unbounded fractionality by A. V. Karzanov On a class of maximum multicommodity flow problems with integer optimal solutions by A. V. Karzanov On edge mappings of graphs preserving subgraphs of a given type by A. K. Kelmans On edge semi-isomorphisms of graphs induced by their isomorphisms by A. K. Kelmans Constructions of cubic bipartite 3-connected graphs without Hamiltonian cycles by A. K. Kelmans Nonseparating circuits and the planarity of graph-cells by A. K. Kelmans Extremal sets and covering and packing problems in matroids by A. K. Kelmans and V. P. Polesskii Optimal distribution sorting by E. V. Kendys, V. M. Makarov, A. R. Rubinov, and E. M. Tishkin Branching packing in weighted graphs by P. A. Pevzner Non-3-crossing families and multicommodity flows by P. A. Pevzner The vector shortest path problem in the $1_\infty$-norm by A. D. Vainshtein Lower performance bounds for on-line algorithms in the simple two-dimensional rectangle packing problems by A. D. Vainshtein.
