*A Survey*

**Author**: Andreas Brandstãdt,Van Bang Le,Jeremy P. Spinrad

**Publisher:** SIAM

**ISBN:** 089871432X

**Category:** Mathematics

**Page:** 304

**View:** 688

The definitive encyclopedia for the literature on graph classes.

Das fünfbändige "Lexikon der Mathematik" bietet in insgesamt ca.17.000 Stichworteinträgen einen umfassenden Überblick über die moderne Mathematik, ihre Fachterminologie und ihre Anwendungen. Die behandelten Fachgebiete reichen von klassischen Themengebieten wie Geometrie, Zahlentheorie und Geschichte der Mathematik – über Numerische Mathematik, Graphentheorie, Versicherungsmathematik und Optimierung – bis hin zu modernen Anwendungsbereichen wie etwa Wavelets, Codierungstheorie oder Neuronalen Netzen. Besondere Berücksichtigung finden die Biographien bedeutender Wissenschaftler von der Antike bis zur Gegenwart. Dadurch wird dem Umstand Rechnung getragen, dass gerade in der Mathematik eine Fülle von Verfahren, Methoden oder auch Lehrsätzen existieren, die nach berühmten Persönlichkeiten benannt sind – z.B. abelsche Gruppe, Satz des Pythagoras und euklidischer Algorithmus. Ein Charakteristikum des Werkes sind die zahlreichen Essays von international anerkannten Fachleuten, in denen entweder ein mathematisches Fachgebiet übersichtlich vorgestellt oder ein "Highlight" der Mathematik besonders gewürdigt wird. Im vorliegenden vierten Band finden Sie unter anderem Essays über die Zahl und den Satz des Pythagoras. Hauptzielgruppen des Lexikons sind neben Mathematikern in Schule, Hochschule und Wirtschaft vor allem Fachleute und Wissenschaftler benachbarter Disziplinen sowie mathematisch interessierte Laien.Mit der vorliegenden Neuauflage wird das in Umfang und Qualität auf dem deutschsprachigen Markt einzigartige Werk – 15 Jahre nach der Erstveröffentlichung – wieder lieferbar gemacht. Aus diesem Anlass wurden kleinere Ungenauigkeiten korrigiert sowie die Lebensdaten einiger inzwischen leider verstorbener Persönlichkeiten aktualisiert. Aufgrund rechtlicher Unklarheiten mussten die im Erstdruck enthaltenen Porträtabbildungen bekannter Mathematikerinnen und Mathematiker leider entfernt werden.

The 28th International Workshop on Graph-Theoretic Concepts in Computer ? Science (WG 2002) was held in Cesky ́ Krumlov, a beautiful small town in the southern part of the Czech Republic on the river Vltava (Moldau), June 13–15, 2002. The workshop was organized by the Department of Applied Mathematics of the Faculty of Mathematics and Physics of Charles University in Prague. Since 1975, WG has taken place in Germany 20 times, twice in Austria and The Netherlands, and once in Italy, Slovakia, and Switzerland. As in previous years, the workshop aimed at uniting theory and practice by demonstrating how graph-theoretic concepts can be applied to various areas in Computer Science, or by extracting new problems from applications.The workshop was devoted to the theoretical and practical aspects of graph concepts in computer science, and its contributed talks showed how recent research results from algorithmic graph theory can be used in computer science and which graph-theoretic questions arise from new developments in computer science. Altogether 61 research papers were submitted and reviewed by the program committee. The program committee represented the wide scienti?c spectrum, and in a careful reviewing process with four reports per submission it selected 36papersforpresentationattheworkshop.Thereferees’commentsaswellasthe numerous fruitful discussions during the workshop have been taken into account by the authors of these conference proceedings.

This book constitutes the refereed proceedings of the 17th International Conference on Theory and Applications of Satisfiability Testing, SAT 2014, held as part of the Vienna Summer of Logic, VSL 2014, in Vienna, Austria, in July 2014. The 21 regular papers, 7 short papers and 4 tool papers presented together with 2 invited talks were carefully reviewed and selected from 78 submissions. The papers have been organized in the following topical sections: maximum satisfiability; minimal unsatisfiability; complexity and reductions; proof complexity; parallel and incremental (Q)SAT; applications; structure; simplification and solving; and analysis.

The study of graph structure has advanced in recent years with great strides: finite graphs can be described algebraically, enabling them to be constructed out of more basic elements. Separately the properties of graphs can be studied in a logical language called monadic second-order logic. In this book, these two features of graph structure are brought together for the first time in a presentation that unifies and synthesizes research over the last 25 years. The authors not only provide a thorough description of the theory, but also detail its applications, on the one hand to the construction of graph algorithms, and, on the other to the extension of formal language theory to finite graphs. Consequently the book will be of interest to graduate students and researchers in graph theory, finite model theory, formal language theory, and complexity theory.

This volume is dedicated to the theme “Combinatorial Optimization – Theoretical Computer Science: Interfaces and Perspectives” and has two main objectives: the first is to show that bringing together operational research and theoretical computer science can yield useful results for a range of applications, while the second is to demonstrate the quality and range of research conducted by the LAMSADE in these areas.

This book constitutes the refereed proceedings of the 7th Scandinavian Workshop on Algorithm Theory, SWAT 2000, held in Bergen, Norway, in July 2000. The 43 revised full papers presented together with 3 invited contributions were carefully reviewed and selected from a total of 105 submissions. The papers are organized in sections on data structures, dynamic partitions, graph algorithms, online algorithms, approximation algorithms, matchings, network design, computational geometry, strings and algorithm engineering, external memory algorithms, optimization, and distributed and fault-tolerant computing.

This book constitutes the refereed proceedings of the 30th Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2004, held in Merín, Czech Republic, in January 2004. The volume presents 10 invited lectures and 22 full papers selected from 136 submissions. Among the topics covered are computer science theory, programming theory, database systems, information systems, cognitive technologies and Web technologies.

This book constitutes the thoroughly refereed post-proceedings of the 13th International Symposium on Graph Drawing, GD 2005, held in Limerick, Ireland in September 2005. The 38 revised full papers and 3 revised short papers presented together with 3 software demos, 8 posters and a report on the graph drawing contest were carefully selected during two rounds of reviewing and improvement from 101 submissions. All current aspects in graph drawing are addressed ranging from foundational and methodological issues to applications for various classes of graphs in a variety of fields. Also included is a report on the Workshop on Network Analysis and Visualisation held in conjunction with the conference.

Here, the authors strive to change the way logic and discrete math are taught in computer science and mathematics: while many books treat logic simply as another topic of study, this one is unique in its willingness to go one step further. The book traets logic as a basic tool which may be applied in essentially every other area.

The invited lectures given at the 16th. British Combinatorial Conference, July 1997 at Queen Mary and Westfield College.

This book constitutes the refereed proceedings of the 14th International Symposium Fundamentals of Computation Theory, FCT 2003, held in Malmö, Sweden in August 2003. The 36 revised full papers presented together with an invited paper and the abstracts of 2 invited talks were carefully reviewed and selected from 73 submissions. The papers are organized in topical sections on approximibility, algorithms, networks and complexity, computational biology, computational geometry, computational models and complexity, structural complexity, formal languages, and logic.

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 combinatorial optimization. Divided into 11 cohesive sections, the handbook’s 44 chapters focus on graph theory, combinatorial optimization, and algorithmic issues. The book provides readers with the algorithmic and theoretical foundations to: Understand phenomena as shaped by their graph structures Develop needed algorithmic and optimization tools for the study of graph structures Design and plan graph structures that lead to certain desirable behavior With contributions from more than 40 worldwide experts, this handbook equips readers with the necessary techniques and tools to solve problems in a variety of applications. Readers gain exposure to the theoretical and algorithmic foundations of a wide range of topics in graph theory and combinatorial optimization, enabling them to identify (and hence solve) problems encountered in diverse disciplines, such as electrical, communication, computer, social, transportation, biological, and other networks.

This book presents a guide to the extensive literature on the topic of semirings and includes a complete bibliography. It serves as a complement to the existing monographs and a point of reference to researchers and students on this topic. The literature on semirings has evolved over many years, in a variety of languages, by authors representing different schools of mathematics and working in various related fields. Recently, semiring theory has experienced rapid development, although publications are widely scattered. This survey also covers those newly emerged areas of semiring applications that have not received sufficient treatment in widely accessible monographs, as well as many lesser-known or `forgotten' works. The author has been collecting the bibliographic data for this book since 1985. Over the years, it has proved very useful for specialists. For example, J.S. Golan wrote he owed `... a special debt to Kazimierz Glazek, whose bibliography proved to be an invaluable guide to the bewildering maze of literature on semirings'. U. Hebisch and H.J. Weinert also mentioned his collection of literature had been of great assistance to them. Now updated to include publications up to the beginning of 2002, this work is available to a wide readership. Audience: This volume is the first single reference that can guide the interested scholar or student to the relevant publications in semirings, semifields, algebraic theory of languages and automata, positive matrices and other generalisations, and ordered semigroups and groups.