|By Subject > Science and Mathematics > Back In Print > 4 > Introductory Discrete Mathematics|
This concise, undergraduate-level text focuses on combinatorics, graph theory with applications to some standard network optimization problems, and algorithms. Geared toward mathematics and computer science majors, it emphasizes applications, offering more than 200 exercises to help students test their grasp of the material and providing answers to selected exercises. 1991 edition.
|Introductory Discrete Mathematics|
|Author:||V. K . Balakrishnan|
|Contents:||Click to View|
|Dimensions:||6 1/2 x 9 1/4|
Reprint of the Prentice-Hall, Englewood Cliffs, New Jersey, 1991 edition.
|Ready to Buy?|
Add this to your cart
(you can always remove it later.)
Shopping here is Guaranteed Safe!
|Here's a sample of other Dover titles that may interest your customers.|
|Introductory Graph Theory|
by Gary Chartrand
Clear, lively style covers all basics of theory and application, including mathematical models, elementary graph theory, transportation problems, connection problems, party problems, diagraphs and mathematical models, games and puzzles, more. read more
|Set Theory and Logic|
by Robert R. Stoll
Explores sets and relations, the natural number sequence and its generalization, extension of natural numbers to real numbers, logic, informal axiomatic mathematics, Boolean algebras, informal axiomatic set theory, several algebraic theories, and 1st-order theories. read more
|A Short Course in Discrete Mathematics|
by Edward A. Bender
S. Gill Williamson
Explores Boolean functions and computer arithmetic; logic; number theory and cryptography; sets and functions; equivalence and order; and induction, sequences, and series. Assumes some familiarity with calculus. Original 2005 edition. read more
|Real Computing Made Real: Preventing Errors in Scientific and Engineering Calculations|
by Forman S. Acton
This concise guide to trouble-shooting offers practical advice on detecting and removing the bugs, preserving significant figures, avoiding extraneous solutions, and finding efficient iterative processes for solving nonlinear equations. 1996 edition.
|Combinatorial Optimization: Algorithms and Complexity|
by Christos H. Papadimitriou
This graduate-level text considers the Soviet ellipsoid algorithm for linear programming; efficient algorithms for network flow, matching, spanning trees, and matroids; the theory of NP-complete problems; local search heuristics for NP-complete problems, more. 1982 edition. read more
|Computability and Unsolvability|
by Prof. Martin Davis
Classic graduate-level introduction to theory of computability. Discusses general theory of computability, computable functions, operations on computable functions, Turing machines self-applied, unsolvable decision problems, applications of general theory, mathematical logic, Kleene hierarchy, more. read more
|Introduction to Graph Theory|
by Richard J. Trudeau
Aimed at "the mathematically traumatized," this text offers nontechnical coverage of graph theory, with exercises. Discusses planar graphs, Euler's formula, Platonic graphs, coloring, the genus of a graph, Euler walks, Hamilton walks, more. 1976 edition.
|Boolean Algebra and Its Applications|
by J. Eldon Whitesitt
Introductory treatment begins with set theory and fundamentals of Boolean algebra, proceeding to concise accounts of applications to symbolic logic, switching circuits, relay circuits, binary arithmetic, and probability theory. 1961 edition. read more
|Foundations of Combinatorics with Applications|
by Edward A. Bender
S. Gill Williamson
Suitable for upper-level undergraduates and graduate students in engineering, science, and mathematics, this introductory text explores counting and listing, graphs, induction and recursion, and generating functions. Includes numerous exercises (some with solutions), notes, and references.
|Discrete Optimization Algorithms: with Pascal Programs|
by Janusz S. Kowalik
Maciej M. Syslo
Upper-level undergraduates and graduate students will benefit from this treatment of discrete optimization algorithms, which covers linear and integer programming and offers a collection of ready-to-use computer programs. 1983 edition.
|Extremal Graph Theory|
by Bela Bollobas
Concise yet comprehensive, this treatment of extremal graph theory is appropriate for undergraduate and graduate students and features numerous exercises and complete proofs. 1978 edition.
|Pearls in Graph Theory: A Comprehensive Introduction|
by Nora Hartsfield
Stimulating and accessible, this undergraduate-level text covers basic graph theory, colorings of graphs, circuits and cycles, labeling graphs, drawings of graphs, measurements of closeness to planarity, graphs on surfaces, and applications and algorithms. 1994 edition.
|Factorization Methods for Discrete Sequential Estimation|
by Gerald J. Bierman
Geared toward advanced undergraduates and graduate students, this text describes matrix factorization methods employed by numerical analysts, featuring techniques that lead to efficient, economical, reliable, and flexible estimation algorithms. 1977 edition.
|The Umbral Calculus|
by Steven Roman
This introductory text explores Sheffer sequences and operators and their adjoints, the connection constants problem and duplication formulas, the Lagrange inversion formula, operational formulas, inverse relations, and binomial convolution. 1984 edition. read more
|Planar Graphs: Theory and Algorithms|
by T. Nishizeki
This text features most of the important theorems and algorithms for planar graphs. Suitable as a textbook, it is also useful for researchers and includes an extensive reference section. 1988 edition. read more
|The Theory of Graphs|
by Claude Berge
Well-written text illustrates development of graph theory and application of its principles in methods both formal and abstract. Practical examples explain theory's broad range, from behavioral sciences to cybernetics. 1966 edition. Includes 109 black-and-white illustrations.
|Analytical Methods of Optimization|
by D. F. Lawden
Suitable for advanced undergraduates and graduate students, this text surveys the classical theory of the calculus of variations. Topics include static systems, control systems, additional constraints, the Hamilton-Jacobi equation, and the accessory optimization problem. 1975 edition.
|Applied Probability Models with Optimization Applications|
by Sheldon M. Ross
Concise advanced-level introduction to stochastic processes that arise in applied probability. Poisson process, renewal theory, Markov chains, Brownian motion, much more. Problems. References. Bibliography. 1970 edition.
|Optimization Theory with Applications|
by Donald A. Pierre
Broad-spectrum approach to important topic. Explores the classic theory of minima and maxima, classical calculus of variations, simplex technique and linear programming, optimality and dynamic programming, more. 1969 edition.
|Statistical Optimization for Geometric Computation: Theory and Practice|
by Kenichi Kanatani
This text discusses the mathematical foundations of statistical inference for building 3-dimensional models from image and sensor data that contain noise — a task involving autonomous robots guided by video cameras and sensors.
|Variational Methods in Optimization|
by Donald R. Smith
Highly readable text elucidates applications of the chain rule of differentiation, integration by parts, parametric curves, line integrals, double integrals, and elementary differential equations. 1974 edition.
|Methods of Mathematics Applied to Calculus, Probability, and Statistics|
by Richard W. Hamming
This 4-part treatment begins with algebra and analytic geometry and proceeds to an exploration of the calculus of algebraic functions and transcendental functions and applications. 1985 edition. Includes 310 figures and 18 tables. read more
|Numerical Methods for Scientists and Engineers|
by Richard Hamming
This inexpensive paperback edition of a groundbreaking text stresses frequency approach in coverage of algorithms, polynomial approximation, Fourier approximation, exponential approximation, and other topics. Revised and enlarged 2nd edition. read more