Matroid theory is one of the deepest branches of combinatorics, and important to applications. Odd numbered chapters introduce mathematical results including many algorithms, which are then immediately applied in the even numbered chapters that follow. The application chapters contain the definitions of the engineering concepts to help mathematicians understand the applications. Matroid theory is, in a sense, a common generalization of graph theory, linear algebra, and geometry, new concepts are presented in the language of graphs, matrices, and geometrical objects wherever possible. The book is aimed at mathematicians and engineers.

I. The topics of this book The concept of a matroid has been known for more than five decades. Whitney (1935) introduced it as a common generalization of graphs and matrices. In the last two decades, it has become clear how important the concept is, for the following reasons: (1) Combinatorics (or discrete mathematics) was considered by many to be a collection of interesting, sometimes deep, but mostly unrelated ideas. However, like other branches of mathematics, combinatorics also encompasses some gen eral tools that can be learned and then applied, to various problems. Matroid theory is one of these tools. (2) Within combinatorics, the relative importance of algorithms has in creased with the spread of computers. Classical analysis did not even consider problems where "only" a finite number of cases were to be studied. Now such problems are not only considered, but their complexity is often analyzed in con siderable detail. Some questions of this type (for example, the determination of when the so called "greedy" algorithm is optimal) cannot even be answered without matroidal tools.

This volume contains the proceedings of the 1995 AMS-IMS-SIAM Joint Summer Research Conference on Matroid Theory held at the University of Washington, Seattle. The book features three comprehensive surveys that bring the reader to the forefront of research in matroid theory. Joseph Kung's encyclopedic treatment of the critical problem traces the development of this problem from its origins through its numerous links with other branches of mathematics to the current status of its many aspects. James Oxley's survey of the role of connectivity and structure theorems in matroid theory stresses the influence of the Wheels and Whirls Theorem of Tutte and the Splitter Theorem of Seymour. Walter Whiteley's article unifies applications of matroid theory to constrained geometrical systems, including the rigidity of bar-and-joint frameworks, parallel drawings, and splines. These widely accessible articles contain many new results and directions for further research and applications. The surveys are complemented by selected short research papers. The volume concludes with a chapter of open problems. Features: Self-contained, accessible surveys of three active research areas in matroid theory. Many new results. Pointers to new research topics. A chapter of open problems. Mathematical applications. Applications and connections to other disciplines, such as computer-aided design and electrical and structural engineering.

A matroid is an abstract mathematical structure that captures combinatorial properties of matrices. This book offers a unique introduction to matroid theory, emphasizing motivations from matrix theory and applications to systems analysis. This book serves also as a comprehensive presentation of the theory and application of mixed matrices, developed primarily by the present author in the 1990's. A mixed matrix is a convenient mathematical tool for systems analysis, compatible with the physical observation that "fixed constants" and "system parameters" are to be distinguished in the description of engineering systems. This book will be extremely useful to graduate students and researchers in engineering, mathematics and computer science. From the reviews: "...The book has been prepared very carefully, contains a lot of interesting results and is highly recommended for graduate and postgraduate students." András Recski, Mathematical Reviews Clippings 2000m:93006

I. The topics of this book The concept of a matroid has been known for more than five decades. Whitney (1935) introduced it as a common generalization of graphs and matrices. In the last two decades, it has become clear how important the concept is, for the following reasons: (1) Combinatorics (or discrete mathematics) was considered by many to be a collection of interesting, sometimes deep, but mostly unrelated ideas. However, like other branches of mathematics, combinatorics also encompasses some gen eral tools that can be learned and then applied, to various problems. Matroid theory is one of these tools. (2) Within combinatorics, the relative importance of algorithms has in creased with the spread of computers. Classical analysis did not even consider problems where "only" a finite number of cases were to be studied. Now such problems are not only considered, but their complexity is often analyzed in con siderable detail. Some questions of this type (for example, the determination of when the so called "greedy" algorithm is optimal) cannot even be answered without matroidal tools.

This book presents a framework for the control of networked systems utilizing submodular optimization techniques. The main focus is on selecting input nodes for the control of networked systems, an inherently discrete optimization problem with applications in power system stability, social influence dynamics, and the control of vehicle formations. The first part of the book is devoted to background information on submodular functions, matroids, and submodular optimization, and presents algorithms for distributed submodular optimization that are scalable to large networked systems. In turn, the second part develops a unifying submodular optimization approach to controlling networked systems based on multiple performance and controllability criteria. Techniques are introduced for selecting input nodes to ensure smooth convergence, synchronization, and robustness to environmental and adversarial noise. Submodular optimization is the first unifying approach towards guaranteeing both performance and controllability with provable optimality bounds in static as well as time-varying networks. Throughout the text, the submodular framework is illustrated with the help of numerical examples and application-based case studies in biological, energy and vehicular systems. The book effectively combines two areas of growing interest, and will be especially useful for researchers in control theory, applied mathematics, networking or machine learning with experience in submodular optimization but who are less familiar with the problems and tools available for networked systems (or vice versa). It will also benefit graduate students, offering consistent terminology and notation that greatly reduces the initial effort associated with beginning a course of study in a new area.

Topics in Matroid Theory provides a brief introduction to matroid theory with an emphasis on algorithmic consequences.Matroid theory is at the heart of combinatorial optimization and has attracted various pioneers such as Edmonds, Tutte, Cunningham and Lawler among others. Matroid theory encompasses matrices, graphs and other combinatorial entities under a common, solid algebraic framework, thereby providing the analytical tools to solve related difficult algorithmic problems. The monograph contains a rigorous axiomatic definition of matroids along with other necessary concepts such as duality, minors, connectivity and representability as demonstrated in matrices, graphs and transversals. The author also presents a deep decomposition result in matroid theory that provides a structural characterization of graphic matroids, and show how this can be extended to signed-graphic matroids, as well as the immediate algorithmic consequences.

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.

The fusion between graph theory and combinatorial optimization has led to theoretically profound and practically useful algorithms, yet there is no book that currently covers both areas together. Handbook of Graph Theory, Combinatorial Optimization, and Algorithms is the first to present a unified, comprehensive treatment of both graph theory and c