AMS eBook CollectionsOne of the world's most respected mathematical collections, available in digital format for your library or institution

Selected Topics in Discrete Mathematics: Proceedings of the Moscow Discrete Mathematics Seminar, 1972–1990

About this Title

A. K. Kelmans, Editor. Translated by Alek Vainshtein, Simeon Ivanov and A V Karzanov

Publication: American Mathematical Society Translations: Series 2
Publication Year: 1994; Volume 158
ISBNs: 978-0-8218-7509-4 (print); 978-1-4704-3369-7 (online)
DOI: https://doi.org/10.1090/trans2/158
MathSciNet review: MR1269122
MSC: Primary 05-06

View full volume as PDF

Read more about this volume

Table of Contents

Download chapters as PDF

Front/Back Matter

• View this volume's front and back matter

Chapters

• L. G. Babat – Approximate evaluation of a linear function at the vertices of the unit $n$-dimensional cube
• L. G. Babat – On the growth of coefficients in an integral linear aggregation
• B. V. Cherkasskiĭ – A fast algorithm for constructing a maximum flow through a network
• V. P. Grishukhin – On the extremality of the rank function of a connected semimodular lattice
• V. P. Grishukhin – On polynomial solvability conditions for the simplest plant location problem
• A. V. Karzanov – Minimal mean weight cuts and cycles in directed graphs
• A. V. Karzanov – An algorithm for determining a maximum packing of odd-terminus cuts, and its applications
• A. V. Karzanov – Maximum- and minimum-cost multicommodity flow problems having unbounded fractionality
• A. V. Karzanov – On a class of maximum multicommodity flow problems with integer optimal solutions
• A. K. Kelmans – On edge mappings of graphs preserving subgraphs of a given type
• A. K. Kelmans – On edge semi-isomorphisms of graphs induced by their isomorphisms
• A. K. Kelmans – Constructions of cubic bipartite 3-connected graphs without Hamiltonian cycles
• A. K. Kelmans – Nonseparating circuits and the planarity of graph-cells
• A. K. Kelmans and V. P. Polesskiĭ – Extremal sets and covering and packing problems in matroids
• E. V. Kendys, V. M. Makarov, A. R. Rubinov and E. M. Tishkin – Optimal distribution sorting
• P. A. Pevzner – Branching packing in weighted graphs
• P. A. Pevzner – Non-3-crossing families and multicommodity flows
• A. D. Vaĭnshteĭn – The vector shortest path problem in the $l_\infty$-norm
• A. D. Vaĭnshteĭn – Lower performance bounds for on-line algorithms in the simple two-dimensional rectangle packing problems