Resultados de Pesquisa

INGLÊS

Steiner Tree Problem

de D.S. Richards, F.K. Hwang e P. Winter

58,29€ + 10% EM CARTÃO

DISPONIBILIDADE IMEDIATA

 The Steiner problem asks for a shortest network which spans a given set of points. Minimum spanning networks have been well-studied when all connections are required to be between the given points. The novelty of the Steiner tree problem is that new auxiliary points can be introduced between the original points so that a spanning network of all the points will be shorter than otherwise possible. These new points are called Steiner points - locating them has proved problematic and research has diverged along many different avenues.This volume is devoted to the assimilation of the rich field of intriguing analyses and the consolidation of the fragments. A section has been given to each of the three major areas of interest which have emerged. The first concerns the Euclidean Steiner Problem, historically the original Steiner tree problem proposed by Jarník and Kössler in 1934. The second deals with the Steiner Problem in Networks, which was propounded independently by Hakimi and Levin and has enjoyed the most prolific research amongst the three areas. The Rectilinear Steiner Problem, introduced by Hanan in 1965, is discussed in the third part. Additionally, a forth section has been included, with chapters discussing areas where the body of results is still emerging.The collaboration of three authors with different styles and outlooks affords individual insights within a cohesive whole.
INGLÊS

Combinatorial Designs - A Tribute To Haim Hanani

58,29€ + 10% EM CARTÃO

DISPONIBILIDADE IMEDIATA

 Haim Hanani pioneered the techniques for constructing designs and the theory of pairwise balanced designs, leading directly to Wilson''s Existence Theorem. He also led the way in the study of resolvable designs, covering and packing problems, latin squares, 3-designs and other combinatorial configurations.The Hanani volume is a collection of research and survey papers at the forefront of research in combinatorial design theory, including Professor Hanani''s own latest work on Balanced Incomplete Block Designs. Other areas covered include Steiner systems, finite geometries, quasigroups, and t-designs.
INGLÊS

Graph Theory In Memory Of G.A. Dirac

58,29€ + 10% EM CARTÃO

DISPONIBILIDADE IMEDIATA

 This volume is a tribute to the life and mathematical work of G.A. Dirac (1925-1984). One of the leading graph theorists, he developed methods of great originality and made many fundamental discoveries.The forty-two papers are all concerned with (or related to) Dirac's main lines of research. A number of mathematicians pay tribute to his memory by presenting new results in different areas of graph theory. Among the topics included are paths and cycles, hamiltonian graphs, vertex colouring and critical graphs, graphs and surfaces, edge-colouring, and infinite graphs.Some of the papers were originally presented at a meeting held in Denmark in 1985. Attendance being by invitation only, some 55 mathematicians from 14 countries participated in various lectures and discussions on graph theory related to the work of Dirac. This volume contains contributions from others as well, so should not be regarded only as the proceedings of that meeting. A problems section is included, as well as a listing of Dirac's own publications.
INGLÊS

Discrete Optimization I

117,93€ + 10% EM CARTÃO

DISPONIBILIDADE IMEDIATA

 Discrete Optimization I
INGLÊS

Studies In Integer Programming

117,93€ + 10% EM CARTÃO

DISPONIBILIDADE IMEDIATA

 Studies in Integer Programming
INGLÊS

Combinatorics '90 - Recent Trends And Applications

58,29€ + 10% EM CARTÃO

DISPONIBILIDADE IMEDIATA

 This volume forms a valuable source of information on recent developments in research in combinatorics, with special regard to the geometric point of view. Topics covered include: finite geometries (arcs, caps, special varieties in a Galois space; generalized quadrangles; Benz planes; foundation of geometry), partial geometries, Buekenhout geometries, transitive permutation sets, flat-transitive geometries, design theory, finite groups, near-rings and semifields, MV-algebras, coding theory, cryptography and graph theory in its geometric and design aspects.
INGLÊS

Quo Vadis, Graph Theory? - A Source Book For Challenges And Directions

58,29€ + 10% EM CARTÃO

DISPONIBILIDADE IMEDIATA

 In the rapidly growing field of graph theory, it is important to ask "Where is all of this activity taking us?", "What are the next important steps to take?" - in short, "Quo vadis, graph theory?". This volume is intended to provide a reference for future directions and open questions in the field.
INGLÊS

Graph Colouring And Variations

58,29€ + 10% EM CARTÃO

DISPONIBILIDADE IMEDIATA

 Graph Colouring and Variations
INGLÊS

Submodular Functions And Electrical Networks

de H. Narayanan

109,98€ + 10% EM CARTÃO

DISPONIBILIDADE IMEDIATA

 There is a strong case for electrical network topologists and submodular function theorists being aware of each other''s fields.Presenting a topological approach to electrical network theory, this book demonstrates the strong links that exist between submodular functions and electrical networks.The book contains:• a detailed discussion of graphs, matroids, vector spaces and the algebra of generalized minors, relevant to network analysis (particularly to the construction of efficient circuit simulators)• a detailed discussion of submodular function theory in its own right; topics covered include, various operations, dualization, convolution and Dilworth truncation as well as the related notions of prinicpal partition and principal lattice of partitions.In order to make the book useful to a wide audience, the material on electrical networks and that on submodular functions is presented independently of each other. The hybrid rank problem, the bridge between (topological) electrical network theory and submodular functions, is covered in the final chapter.The emphasis in the book is on low complexity algorithms, particularly based on bipartite graphs.The book is intended for self-study and is recommended to designers of VLSI algorithms. More than 300 problems, almost all of them with solutions, are included at the end of each chapter.
INGLÊS

Fourth Czechoslovakian Symposium On Combinatorics, Graphs And Complexity

58,29€ + 10% EM CARTÃO

DISPONIBILIDADE IMEDIATA

 This volume in the Annals of Discrete Mathematics brings together contributions by renowned researchers in combinatorics, graphs and complexity. The conference on which this book is based was the fourth in a series which began in 1963, which was the first time specialists from East and West were able to come together. The 1990 meeting attracted 170 mathematicians and computer scientists from around the world, so this book represents an international, detailed view of recent research.
INGLÊS

Topics On Domination

de R.C. Laskar e S.T. Hedetniemi

58,29€ + 10% EM CARTÃO

DISPONIBILIDADE IMEDIATA

 The contributions in this volume are divided into three sections: theoretical, new models and algorithmic. The first section focuses on properties of the standard domination number &ggr;(G), the second section is concerned with new variations on the domination theme, and the third is primarily concerned with finding classes of graphs for which the domination number (and several other domination-related parameters) can be computed in polynomial time.
INGLÊS

Latin Squares - New Developments In The Theory And Applications

de A. Donald Keedwell e Jozsef Denes

58,29€ + 10% EM CARTÃO

DISPONIBILIDADE IMEDIATA

 In 1974 the editors of the present volume published a well-received book entitled ``Latin Squares and their Applications''''. It included a list of 73 unsolved problems of which about 20 have been completely solved in the intervening period and about 10 more have been partially solved. The present work comprises six contributed chapters and also six further chapters written by the editors themselves. As well as discussing the advances which have been made in the subject matter of most of the chapters of the earlier book, this new book contains one chapter which deals with a subject (r-orthogonal latin squares) which did not exist when the earlier book was written.The success of the former book is shown by the two or three hundred published papers which deal with questions raised by it.
INGLÊS

Algebraic And Structural Automata Theory

58,29€ + 10% EM CARTÃO

DISPONIBILIDADE IMEDIATA

 Automata Theory is part of computability theory which covers problems in computer systems, software, activity of nervous systems (neural networks), and processes of live organisms development.The result of over ten years of research, this book presents work in the following areas of Automata Theory: automata morphisms, time-varying automata, automata realizations and relationships between automata and semigroups.Aimed at those working in discrete mathematics and computer science, parts of the book are suitable for use in graduate courses in computer science, electronics, telecommunications, and control engineering. It is assumed that the reader is familiar with the basic concepts of algebra and graph theory.
INGLÊS

Logic-Based Decision Support - Mixed Integer Model Formulation

de R.G. Jeroslow

58,29€ + 10% EM CARTÃO

DISPONIBILIDADE IMEDIATA

 This monograph is based on a series of lectures given by the author at the first Advanced Research Institute on Discrete Applied Mathematics, held at Rutgers University. It emphasizes connections between the representational aspects of mixed integer programming and applied logic, as well as discussing logic-based approaches to decision support which help to create more `intelligent'' systems. Dividing naturally into two parts, the first four chapters are an overview of mixed-integer programming representability techniques. This is followed by five chapters on applied logic, expert systems, logic and databases, and complexity theory. It concludes with a summary of open research issues and an attempt to extrapolate trends in this rapidly developing area.
INGLÊS

Graph Theory And Applications

58,29€ + 10% EM CARTÃO

DISPONIBILIDADE IMEDIATA

 Graph Theory and Applications
INGLÊS

Combinatorics '86

117,93€ + 10% EM CARTÃO

DISPONIBILIDADE IMEDIATA

 Recent developments in all aspects of combinatorial and incidence geometry are covered in this volume, including their links with the foundations of geometry, graph theory and algebraic structures, and the applications to coding theory and computer science.Topics covered include Galois geometries, blocking sets, affine and projective planes, incidence structures and their automorphism groups. Matroids, graph theory and designs are also treated, along with weak algebraic structures such as near-rings, near-fields, quasi-groups, loops, hypergroups etc., and permutation sets and groups.The vitality of combinatorics today lies in its important interactions with computer science. The problems which arise are of a varied nature and suitable techniques to deal with them have to be devised for each situation; one of the special features of combinatorics is the often sporadic nature of solutions, stemming from its links with number theory. The branches of combinatorics are many and various, and all of them are represented in the 56 papers in this volume.
INGLÊS

Recent Results In The Theory Of Graph Spectra

de A. Torgasev, D.M. Cvetkovic, I. Gutman e M. Doob

58,29€ + 10% EM CARTÃO

DISPONIBILIDADE IMEDIATA

 The purpose of this volume is to review the results in spectral graph theory which have appeared since 1978.The problem of characterizing graphs with least eigenvalue -2 was one of the original problems of spectral graph theory. The techniques used in the investigation of this problem have continued to be useful in other contexts including forbidden subgraph techniques as well as geometric methods involving root systems. In the meantime, the particular problem giving rise to these methods has been solved almost completely. This is indicated in Chapter 1.The study of various combinatorial objects (including distance regular and distance transitive graphs, association schemes, and block designs) have made use of eigenvalue techniques, usually as a method to show the nonexistence of objects with certain parameters. The basic method is to construct a graph which contains the structure of the combinatorial object and then to use the properties of the eigenvalues of the graph. Methods of this type are given in Chapter 2.Several topics have been included in Chapter 3, including the relationships between the spectrum and automorphism group of a graph, the graph isomorphism and the graph reconstruction problem, spectra of random graphs, and the Shannon capacity problem. Some graph polynomials related to the characteristic polynomial are described in Chapter 4. These include the matching, distance, and permanental polynomials. Applications of the theory of graph spectra to Chemistry and other branches of science are described from a mathematical viewpoint in Chapter 5. The last chapter is devoted to the extension of the theory of graph spectra to infinite graphs.
INGLÊS

Theories Of Computational Complexity

de C. Calude

119,25€ + 10% EM CARTÃO

DISPONIBILIDADE IMEDIATA

 This volume presents four machine-independent theories of computational complexity, which have been chosen for their intrinsic importance and practical relevance. The book includes a wealth of results - classical, recent, and others which have not been published before.In developing the mathematics underlying the size, dynamic and structural complexity measures, various connections with mathematical logic, constructive topology, probability and programming theories are established. The facts are presented in detail. Extensive examples are provided, to help clarify notions and constructions. The lists of exercises and problems include routine exercises, interesting results, as well as some open problems.
INGLÊS

Linear And Combinatorial Optimization In Ordered Algebraic Structures

117,93€ + 10% EM CARTÃO

DISPONIBILIDADE IMEDIATA

 Linear and Combinatorial Optimization in Ordered Algebraic Structures
INGLÊS

Advances In Graph Theory

117,93€ + 10% EM CARTÃO

DISPONIBILIDADE IMEDIATA

 Advances in Graph Theory
INGLÊS

Algorithmic Aspects Of Combinatorics

117,93€ + 10% EM CARTÃO

DISPONIBILIDADE IMEDIATA

 Algorithmic Aspects of Combinatorics
INGLÊS

Lukasiewicz-Moisil Algebras

de A. Filipoiu, G. Georgescu, S. Rudeanu e V. Boicescu

58,29€ + 10% EM CARTÃO

DISPONIBILIDADE IMEDIATA

 The Lukasiewicz-Moisil algebras were created by Moisil as an algebraic counterpart for the many-valued logics of Lukasiewicz. The theory of LM-algebras has developed to a considerable extent both as an algebraic theory of intrinsic interest and in view of its applications to logic and switching theory.This book gives an overview of the theory, comprising both classical results and recent contributions, including those of the authors. N-valued and &THgr;-valued algebras are presented, as well as &THgr;-algebras with negation.Mathematicians interested in lattice theory or symbolic logic, and computer scientists, will find in this monograph stimulating material for further research.
INGLÊS

Submodular Functions And Optimization

de S. Fujishige

58,29€ + 10% EM CARTÃO

DISPONIBILIDADE IMEDIATA

 The importance of submodular functions has been widely recognized in recent years in combinatorial optimization. This is the first book devoted to the exposition of the theory of submodular functions from an elementary technical level to an advanced one. A unifying view of the theory is shown by means of base polyhedra and duality for submodular and supermodular systems. Among the subjects treated are: neoflows (submodular flows, independent flows, polymatroidal flows), submodular analysis (submodular programs, duality, Lagrangian functions, principal partitions), nonlinear optimization with submodular constraints (lexicographically optimal bases, fair resource allocation). Special emphasis is placed on the constructive aspects of the theory, which lead to practical, efficient algorithms.
INGLÊS

Graph Theory And Combinatorics 1988

58,29€ + 10% EM CARTÃO

DISPONIBILIDADE IMEDIATA

 Combinatorics has not been an established branch of mathematics for very long: the last quarter of a century has seen an explosive growth in the subject. This growth has been largely due to the doyen of combinatorialists, Paul Erds, whose penetrating insight and insatiable curiosity has provided a huge stimulus for workers in the field. There is hardly any branch of combinatorics that has not been greatly enriched by his ideas.This volume is dedicated to Paul Erds on the occasion of his seventy-fifth birthday.
A carregar resultados...

Ver mais resultados