Descargar Libros y Ebooks (PDF / EPUB)

Structures of Domination in Graphs

Autor: Teresa W. Haynes , Stephen T. Hedetniemi , Michael A. Henning

Número de Páginas: 533

This volume comprises 17 contributions that present advanced topics in graph domination, featuring open problems, modern techniques, and recent results. The book is divided into 3 parts. The first part focuses on several domination-related concepts: broadcast domination, alliances, domatic numbers, dominator colorings, irredundance in graphs, private neighbor concepts, game domination, varieties of Roman domination and spectral graph theory. The second part covers domination in hypergraphs, chessboards, and digraphs and tournaments. The third part focuses on the development of algorithms and complexity of signed, minus and majority domination, power domination, and alliances in graphs. The third part also includes a chapter on self-stabilizing algorithms. Of extra benefit to the reader, the first chapter includes a glossary of commonly used terms. The book is intended to provide a reference for established researchers in the fields of domination and graph theory and graduate students who wish to gain knowledge of the topics covered as well as an overview of the major accomplishments and proof techniques used in the field.

Fundamentals of Domination in Graphs

Autor: Teresa W. Haynes , Stephen Hedetniemi , Peter Slater

Número de Páginas: 465

"Provides the first comprehensive treatment of theoretical, algorithmic, and application aspects of domination in graphs-discussing fundamental results and major research accomplishments in an easy-to-understand style. Includes chapters on domination algorithms and NP-completeness as well as frameworks for domination."

Topics on Domination

Autor: S.t. Hedetniemi , R.c. Laskar

Número de Páginas: 287

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.

Structural Analysis of Complex Networks

Autor: Matthias Dehmer

Número de Páginas: 493

Because of the increasing complexity and growth of real-world networks, their analysis by using classical graph-theoretic methods is oftentimes a difficult procedure. As a result, there is a strong need to combine graph-theoretic methods with mathematical techniques from other scientific disciplines, such as machine learning and information theory, in order to analyze complex networks more adequately. Filling a gap in literature, this self-contained book presents theoretical and application-oriented results to structurally explore complex networks. The work focuses not only on classical graph-theoretic methods, but also demonstrates the usefulness of structural graph theory as a tool for solving interdisciplinary problems. Special emphasis is given to methods related to: applications in biology, chemistry, linguistics, and data analysis; graph colorings; graph polynomials; information measures for graphs; metrical properties of graphs; partitions and decompositions; and quantitative graph measures. Structural Analysis of Complex Networks is suitable for a broad, interdisciplinary readership of researchers, practitioners, and graduate students in discrete mathematics, statistics,...

Topics in Domination in Graphs

Autor: Teresa W. Haynes , Stephen T. Hedetniemi , Michael A. Henning

Número de Páginas: 545

This volume comprises 16 contributions that present advanced topics in graph domination, featuring open problems, modern techniques, and recent results. The focus is on primary dominating sets such as paired domination, connected domination, restrained domination, dominating functions, Roman domination, and power domination. Additionally, surveys include known results with a sample of proof techniques for each parameter. Of extra benefit to the reader, the first chapter includes a glossary of commonly used terms; the second chapter provides an overview of models of domination from which the parameters are defined. The book is intended to provide a reference for established researchers in the fields of domination and graph theory and graduate students who wish to gain knowledge of the topics covered as well as an overview of the major accomplishments in the field and proof techniques used.

Research Trends in Graph Theory and Applications

Autor: Daniela Ferrero , Leslie Hogben , Sandra R. Kingan , Gretchen L. Matthews

Número de Páginas: 150

The Workshop for Women in Graph Theory and Applications was held at the Institute for Mathematics and Its Applications (University of Minnesota, Minneapolis) on August 19-23, 2019. During this five-day workshop, 42 participants performed collaborative research, in six teams, each focused on open problems in different areas of graph theory and its applications. The research work of each team was led by two experts in the corresponding area, who prior to the workshop, carefully selected relevant and meaningful open problems that would yield high-quality research and results of strong impact. As a result, all six teams have made significant contributions to several open problems in their respective areas. The workshop led to the creation of the Women in Graph Theory and Applications Research Collaboration Network, which provided the framework to continue collaborating and to produce this volume. This book contains six chapters, each of them on one of the different areas of research at the Workshop for Women in Graph Theory and Applications, and written by participants of each team.

Algorithms and Data Structures

Autor: Frank Dehne

Número de Páginas: 656

The papers in this volume were presented at the Third Workshop on Algorithmsand Data Structures (WADS '93), held in Montreal, Canada, August 1993. The volume opens with five invited presentations: "Computing the all-pairs longest chains in the plane" by M.J. Atallah and D.Z. Chen, "Towards a better understanding of pure packet routing" by A. Borodin, "Tolerating faults in meshes and other networks" (abstract) by R. Cole, "A generalization of binary search" by R.M. Karp, and "Groups and algebraic complexity" (abstract) by A.C. Yao. The volume continues with 52 regular presentations selected from 165 submissions, each of which was evaluated by at least three program committee members, many of whom called upon additional reviewers.

Domination in Graphs: Core Concepts

Autor: Teresa W. Haynes , Stephen T. Hedetniemi , Michael A. Henning

Número de Páginas: 655

This monograph is designed to be an in-depth introduction to domination in graphs. It focuses on three core concepts: domination, total domination, and independent domination. It contains major results on these foundational domination numbers, including a wide variety of in-depth proofs of selected results providing the reader with a toolbox of proof techniques used in domination theory. Additionally, the book is intended as an invaluable reference resource for a variety of readerships, namely, established researchers in the field of domination who want an updated, comprehensive coverage of domination theory; next, researchers in graph theory who wish to become acquainted with newer topics in domination, along with major developments in the field and some of the proof techniques used; and, graduate students with interests in graph theory, who might find the theory and many real-world applications of domination of interest for masters and doctoral thesis topics. The focused coverage also provides a good basis for seminars in domination theory or domination algorithms and complexity. The authors set out to provide the community with an updated and comprehensive treatment on the...

STACS 94

Autor: Patrice Enjalbert , Ernst W. Mayr , Klaus W. Wagner

Número de Páginas: 802

This volume constitutes the proceedings of the 11th annual Symposium on Theoretical Aspects of Computer Science (STACS '94), held in Caen, France, February 24-26, 1994. Besides three prominent invited papers, the proceedings contains 60 accepted contributions chosen by the international program committee during a highly competitive reviewing process from a total of 234 submissions for 38 countries. The volume competently represents most areas of theoretical computer science with a certain emphasis on (parallel) algorithms and complexity.

Handbook of Graph Theory, Combinatorial Optimization, and Algorithms

Autor: Krishnaiyan "kt" Thulasiraman , Subramanian Arumugam , Andreas Brandstädt , Takao Nishizeki

Número de Páginas: 1217

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

Advanced Fractal Graph Theory and Applications

Autor: P. Tharaniya , G. Jayalalitha , Pethuru Raj , B. Sundaravadivazhagan

Número de Páginas: 265

This book explores the dynamic interplay between fractals and graph theory, two powerful mathematical tools with vast applications. It presents a strategic combination and the synergistic use of these disciplines to address real-world problems and challenges. The book begins with an introduction to the basic concepts of fractals and graph theory and goes on to explore the applications in various domains, including natural phenomena modeling, scheduling, and network optimisation. This book: Illustrates the innovative ways fractals and graph theory can be combined, laying the groundwork for future applications across various industries Introduces the fundamental concepts and principles of both fractals and graph theory in detail, making it accessible to a broad audience, including those new to these topics Explores practical applications in image processing, network optimisation, social network analysis, and more, demonstrating the real-world impact of these mathematical tools Analyses advanced techniques in graph theory, such as matching, domination, and colouring, with practical examples and case studies Highlights the latest research advancements in fractal graph theory,...

50 years of Combinatorics, Graph Theory, and Computing

Autor: Fan Chung , Ron Graham , Frederick Hoffman , Ronald C. Mullin , Leslie Hogben , Douglas B. West

Número de Páginas: 410

50 Years of Combinatorics, Graph Theory, and Computing advances research in discrete mathematics by providing current research surveys, each written by experts in their subjects. The book also celebrates outstanding mathematics from 50 years at the Southeastern International Conference on Combinatorics, Graph Theory & Computing (SEICCGTC). The conference is noted for the dissemination and stimulation of research, while fostering collaborations among mathematical scientists at all stages of their careers. The authors of the chapters highlight open questions. The sections of the book include: Combinatorics; Graph Theory; Combinatorial Matrix Theory; Designs, Geometry, Packing and Covering. Readers will discover the breadth and depth of the presentations at the SEICCGTC, as well as current research in combinatorics, graph theory and computer science. Features: Commemorates 50 years of the Southeastern International Conference on Combinatorics, Graph Theory & Computing with research surveys Surveys highlight open questions to inspire further research Chapters are written by experts in their fields Extensive bibliographies are provided at the end of each chapter

Data Structures and Efficient Algorithms

Autor: Burkhard Monien

Número de Páginas: 406

Myocarditis and idiopathic dilated cardiomyopathy are being increasingly recognized as important causes of heart disease and heart failure. Immunological mechanisms have long been suspected as playing a role in thesediseases but direct evidence has been lacking. Recently, animal models have be- come available, in which myocarditis can be induced either by infection with cardiotropic viruses or by autoimmuniza- tion with heart-specific antigens. This book presents and analyzes the latest information obtained from experimental models, relating it to the practical problems of diagnosis and treatment of myocarditis.

Neutrosophic Sets and Systems, vol. 53/2023

Autor: Florentin Smarandache , Mohamed Abdel-basset , Said Broumi

Número de Páginas: 676

“Neutrosophic Sets and Systems” has been created for publications on advanced studies in neutrosophy, neutrosophic set, neutrosophic logic, neutrosophic probability, neutrosophic statistics that started in 1995 and their applications in any field, such as the neutrosophic structures developed in algebra, geometry, topology, etc. Neutrosophy is a new branch of philosophy that studies the origin, nature, and scope of neutralities, as well as their interactions with different ideational spectra. This theory considers every notion or idea together with its opposite or negation and with their spectrum of neutralities in between them (i.e. notions or ideas supporting neither nor ). The and ideas together are referred to as . Neutrosophy is a generalization of Hegel's dialectics (the last one is based on and only). According to this theory every idea tends to be neutralized and balanced by and ideas - as a state of equilibrium. In a classical way , , are disjoint two by two. But, since in many cases the borders between notions are vague, imprecise, Sorites, it is possible that , , (and of course) have common parts two by two, or even all three of them as well....

Conceptual Structures: Knowledge Architectures for Smart Applications

Autor: Uta Priss , Simon Polovina , Richard Hill

Número de Páginas: 525

Researchers and professionals in the relevant fields will find this book a must-read, as it defines the leading edge of current research into conceptual structures. It constitutes the refereed proceedings of the 15th International Conference on Conceptual Structures, held in Sheffield, UK in July 2007. With almost 50 papers contained in its 500 pages, it includes a special focus on the application of conceptual structures in business and technological settings and is organized into topical sections for ease of reference.

Proceedings of 2nd International Conference on Mathematical Modeling and Computational Science

Autor: Sheng-lung Peng , Cheng-kuan Lin , Souvik Pal

Número de Páginas: 576

The conference proceeding of ICMMCS 2021 presents most recent scientific and technological advances in the fields of engineering mathematics and computational science to strengthen the links in the scientific community. It is a collection of high-quality, peer-reviewed research papers presented at the Second International Conference on Mathematical Modeling and Computational Science (ICMMCS 2021), held online during October 29–30, 2021. The topics covered in the book are mathematical logic and foundations, numerical analysis, neural networks, fuzzy set theory, coding theory, higher algebra, number theory, graph theory and combinatory, computation in complex networks, calculus, differential educations and integration, application of soft computing, knowledge engineering, machine learning, artificial intelligence, big data and data analytics, high-performance computing, network and device security, Internet of Things (IoT).

Cross-Disciplinary Models and Applications of Database Management: Advancing Approaches

Autor: Siau, Keng

Número de Páginas: 531

Within a given enterprise, database management involves the monitoring, administration, and maintenance of the databases, which constantly change with new technologies and new forms of data.Cross-Disciplinary Models and Applications of Database Management: Advancing Approaches is an updated look at the latest tools and technology within the burgeoning field of database management. Perfect for the network administrator, technician, information technology specialist or consultant, or for academics and students, this volume presents the latest the field has to offer by way of cases and new research. As database languages, models, and systems change, it's vital for practitioners within the field to stay abreast of the latest research and methods being used around the world, and this book offers the most current advances available.

Advanced Information Systems Engineering

Autor: Zohra Bellahsène , Michel Léonard

Número de Páginas: 604

CAiSE 2008wasthe20thinthe seriesofInternationalConferencesonAdvanced Information System Engineering. This edition continued the success of previous conferences, a success largely due to that fact that, since its ?rst edition, this series has evolvedin parallelwith the evolutionofthe importance ofinformation systems in economic development. CAiSE has been able to follow, and often to anticipate, important changes that have occurred since 1978 when the ?rst CAiSE conference was organized by Arne Sølvberg and Janis Bubenko. In all these years, modern businesses and IT systems have been facing an ever more complex environment characterized by openness, variety and change. Furthermore, enterprises are experiencing ever more variety in their business in many dimensions. In the same way, the explosion of information technologies is overwhelming with a multitude of languages, platforms, devices, standards and products. Thus enterprises need to manage an environment to monitor the interplay of changes in the business processes, in information technologies, and at the ontological level, in order to achieve a sustainable development of their information systems. Enterprises must enter the...

Sustainable Communication Networks and Application

Autor: P. Karuppusamy , Isidoros Perikos , Fuqian Shi , Tu N. Nguyen

Número de Páginas: 683

This book includes novel and state-of-the-art research discussions that articulate and report all research aspects, including theoretical and experimental prototypes and applications that incorporate sustainability into emerging applications. In recent years, sustainability and information and communication technologies (ICT) are highly intertwined, where sustainability resources and its management has attracted various researchers, stakeholders, and industrialists. The energy-efficient communication technologies have revolutionized the various smart applications like smart cities, healthcare, entertainment, and business. The book discusses and articulates emerging challenges in significantly reducing the energy consumption of communication systems and also explains development of a sustainable and energy-efficient mobile and wireless communication network. It includes best selected high-quality conference papers in different fields such as internet of things, cloud computing, data mining, artificial intelligence, machine learning, autonomous systems, deep learning, neural networks, renewable energy sources, sustainable wireless communication networks, QoS, network sustainability, ...

Library of Congress Subject Headings

Autor: Library Of Congress

Número de Páginas: 1736

Algebra, Graph Theory and their Applications

Autor: T.t Chelvam

Número de Páginas: 138

Algebra and Graph Theory are two fascinating branches of Mathematics. The tools of each have been used in the other to explore and investigate problems in depth. Especially the Cayley graphs constructed out of the group structures have been greatly and extensively used in Parallel computers to provide network to the routing problem. ALGEBRA, GRAPH THEORY AND THEIR APPLICATIONS takes an inclusive view of the two areas and presents a wide range of topics. It includes sixteen referred research articles on algebra and graph theory of which three are expository in nature alongwith articles exhibiting the use of algebraic techniques in the study of graphs. A substantial proportion of the book covers topics that have not yet appeared in book form providing a useful resource to the younger generation of researchers in Discrete Mathematics.

Total Domination in Graphs

Autor: Michael A. Henning , Anders Yeo

Número de Páginas: 184

Total Domination in Graphs gives a clear understanding of this topic to any interested reader who has a modest background in graph theory. This book provides and explores the fundamentals of total domination in graphs. Some of the topics featured include the interplay between total domination in graphs and transversals in hypergraphs, and the association with total domination in graphs and diameter-2-critical graphs. Several proofs are included in this text which enables readers to acquaint themselves with a toolbox of proof techniques and ideas with which to attack open problems in the field. This work is an excellent resource for students interested in beginning their research in this field. Additionally, established researchers will find the book valuable to have as it contains the latest developments and open problems.

Nonlinear Dynamics and Applications

Autor: Santo Banerjee , Asit Saha

Número de Páginas: 1433

This book covers recent trends and applications of nonlinear dynamics in various branches of society, science, and engineering. The selected peer-reviewed contributions were presented at the International Conference on Nonlinear Dynamics and Applications (ICNDA 2022) at Sikkim Manipal Institute of Technology (SMIT) and cover a broad swath of topics ranging from chaos theory and fractals to quantum systems and the dynamics of the COVID-19 pandemic. Organized by the SMIT Department of Mathematics, this international conference offers an interdisciplinary stage for scientists, researchers, and inventors to present and discuss the latest innovations and trends in all possible areas of nonlinear dynamics.

Combinatorial Mathematics

Autor: Douglas B. West

Número de Páginas: 990

This is the most readable and thorough graduate textbook and reference for combinatorics, covering enumeration, graphs, sets, and methods.

Computing and Combinatorics

Autor: Jie Wang

Número de Páginas: 613

39 Iain A. Stewart Algebraic Properties for P-Selectivity. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 49 LaneA. Hemaspaandra,HaraldHempel,ArfstNickelsen Parallelizability of Some P-Complete Geometric Problems in the EREW-PRAM. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 59 Carla Denise Castanho, Wei Chen, Koichi Wada, Akihiro Fujiwara ComputationalBiology Enhanced Sequence Reconstruction with DNA Microarray Application. . . . 64 Samuel A. Heath, Franco P. Preparata Non-approximability of Weighted Multiple Sequence Alignment. . . . . . . . . .

Graph-Theoretic Concepts in Computer Science

Autor: Ernst W. Mayr , Gunther Schmidt , Gottfried Tinhofer

Número de Páginas: 422

This volume presents the proceedings of the 20th International Workshop on Graph-Theoretic Concepts in Computer Science (WG '94), held in Herrsching, Germany in June 1994. The volume contains 32 thoroughly revised papers selected from 66 submissions and provides an up-to-date snapshot of the research performed in the field. The topics addressed are graph grammars, treewidth, special graph classes, algorithms on graphs, broadcasting and architecture, planar graphs and related problems, and special graph problems.

Architecture, Building Materials and Engineering Management

Autor: He Tao Hou , Li Tian

Número de Páginas: 2993

Selected, peer reviewed papers from the 2013 International Conference on Civil, Architecture and Building Materials, (3rd CEABM 2013), May 24-26, 2013, Jinan, China

New Trends in Network Design

Autor: Walid Ben-ameur

Número de Páginas: 222

Applications of Discrete Mathematics

Autor: Richard D. Ringeisen , Fred S. Roberts

Número de Páginas: 250

Algorithms and Data Structures

Número de Páginas: 660

Handbook of Graph Theory, Second Edition

Autor: Jonathan L. Gross , Jay Yellen , Ping Zhang

Número de Páginas: 1634

In the ten years since the publication of the best-selling first edition, more than 1,000 graph theory papers have been published each year. Reflecting these advances, Handbook of Graph Theory, Second Edition provides comprehensive coverage of the main topics in pure and applied graph theory. This second edition—over 400 pages longer than its predecessor—incorporates 14 new sections. Each chapter includes lists of essential definitions and facts, accompanied by examples, tables, remarks, and, in some cases, conjectures and open problems. A bibliography at the end of each chapter provides an extensive guide to the research literature and pointers to monographs. In addition, a glossary is included in each chapter as well as at the end of each section. This edition also contains notes regarding terminology and notation. With 34 new contributors, this handbook is the most comprehensive single-source guide to graph theory. It emphasizes quick accessibility to topics for non-experts and enables easy cross-referencing among chapters.

Library of Congress Subject Headings

Autor: Library Of Congress. Cataloging Policy And Support Office

Número de Páginas: 1688

Graph Classes

Autor: Andreas Brandstadt , Van Bang Le , Jeremy P. Spinrad

Número de Páginas: 307

This well-organized reference is a definitive encyclopedia for the literature on graph classes. It contains a survey of more than 200 classes of graphs, organized by types of properties used to define and characterize the classes, citing key theorems and literature references for each. The authors state results without proof, providing readers with easy access to far more key theorems than are commonly found in other mathematical texts. Interconnections between graph classes are also provided to make the book useful to a variety of readers.

Combinatorial Algorithms for Integrated Circuit Layout

Número de Páginas: 715

The last decade has brought explosive growth in the technology for manufac turing integrated circuits. Integrated circuits with several hundred thousand transistors are now commonplace. This manufacturing capability, combined with the economic benefits of large electronic systems, is forcing a revolution in the design of these systems and providing a challenge to those people in terested in integrated system design. Modern circuits are too complex for an individual to comprehend completely. Managing tremendous complexity and automating the design process have become crucial issues. Two groups are interested in dealing with complexity and in developing algorithms to automate the design process. One group is composed of practi tioners in computer-aided design (CAD) who develop computer programs to aid the circuit-design process. The second group is made up of computer scientists and mathemati'::~l\ns who are interested in the design and analysis of efficient combinatorial aJ::,orithms. These two groups have developed separate bodies of literature and, until recently, have had relatively little interaction. An obstacle to bringing these two groups together is the lack of books that...

Domination in Graphs: Core Concepts

Autor: Teresa W. Haynes , Stephen T. Hedetniemi , Michael A. Henning

Número de Páginas: 0

This monograph is designed to be an in-depth introduction to domination in graphs. It focuses on three core concepts: domination, total domination, and independent domination. It contains major results on these foundational domination numbers, including a wide variety of in-depth proofs of selected results providing the reader with a toolbox of proof techniques used in domination theory. Additionally, the book is intended as an invaluable reference resource for a variety of readerships, namely, established researchers in the field of domination who want an updated, comprehensive coverage of domination theory; next, researchers in graph theory who wish to become acquainted with newer topics in domination, along with major developments in the field and some of the proof techniques used; and, graduate students with interests in graph theory, who might find the theory and many real-world applications of domination of interest for masters and doctoral thesis topics. The focused coverage also provides a good basis for seminars in domination theory or domination algorithms and complexity. The authors set out to provide the community with an updated and comprehensive treatment on the...

Randomization and Approximation Techniques in Computer Science

Número de Páginas: 300

Informatics Engineering and Information Science, Part III

Autor: Azizah Abd Manaf , Shamsul Sahibuddin , Rabiah Ahmad , Salwani Mohd Daud , Eyas El-qawasmeh

Número de Páginas: 740

This 4-Volume-Set, CCIS 0251 - CCIS 0254, constitutes the refereed proceedings of the International Conference on Informatics Engineering and Information Science, ICIEIS 2011, held in Kuala Lumpur, Malaysia, in November 2011. The 210 revised full papers presented together with invited papers in the 4 volumes were carefully reviewed and selected from numerous submissions. The papers are organized in topical sections on e-learning, information security, software engineering, image processing, algorithms, artificial intelligence and soft computing, e-commerce, data mining, neural networks, social networks, grid computing, biometric technologies, networks, distributed and parallel computing, wireless networks, information and data management, web applications and software systems, multimedia, ad hoc networks, mobile computing, as well as miscellaneous topics in digital information and communications.

Discussiones Mathematicae

Número de Páginas: 648

Algorithmic Game Theory

Autor: Xiaotie Deng

Número de Páginas: 292

This book constitutes the refereed proceedings of the 11th International Symposium on Algorithmic Game Theory, SAGT 2018, held in Beijing, China, in September 2018. The 19 full papers presented together with 6 short papers and 5 plenary talks were carefully reviewed and selected from 54 submissions. The papers cover various important aspects of algorithmic game theory including market equilibrium, auctions and applications, two sided markets, cake-cutting, cooperative games, voting games, multi-agent scheduling, price of stability, various mechanism design problems: online-dynamics and multi-stages as well as revenue maximization and resource allocation and applications.

Algorithms, Software, Architecture

Autor: Jan Leeuwen , Robert M. Aiken , Friedrich H. Vogt

Número de Páginas: 764

Paperback. This volume presents contributed and invited papers presented in the following three program streams: Software Development and Maintenance, Algorithms and Efficient Computation, and From Architectures to ChipsThe papers on Software Engineering focus on formal methods, the usefulness of object-oriented system design, and the future of tools and environments. The papers on Efficient Algorithms address a wide range of algorithm design issues from text retrieval to e.g. parallel and distributed computing, and show considerable progress in the design of general techniques and algorithm libraries. The papers on Computer Architectures address developments in concurrent processing, formal design methods and languages, and performance aspects.