Classes of Directed Graphs

Classes of Directed Graphs
Author: Jørgen Bang-Jensen
Publisher: Springer
Total Pages: 654
Release: 2018-06-18
Genre: Mathematics
ISBN: 3319718401

This edited volume offers a detailed account of the theory of directed graphs from the perspective of important classes of digraphs, with each chapter written by experts on the topic. Outlining fundamental discoveries and new results obtained over recent years, this book provides a comprehensive overview of the latest research in the field. It covers core new results on each of the classes discussed, including chapters on tournaments, planar digraphs, acyclic digraphs, Euler digraphs, graph products, directed width parameters, and algorithms. Detailed indices ease navigation while more than 120 open problems and conjectures ensure that readers are immersed in all aspects of the field. Classes of Directed Graphs provides a valuable reference for graduate students and researchers in computer science, mathematics and operations research. As digraphs are an important modelling tool in other areas of research, this book will also be a useful resource to researchers working in bioinformatics, chemoinformatics, sociology, physics, medicine, etc.

Digraphs

Digraphs
Author: Jorgen Bang-Jensen
Publisher: Springer Science & Business Media
Total Pages: 769
Release: 2013-06-29
Genre: Mathematics
ISBN: 1447138864

The study of directed graphs (digraphs) has developed enormously over recent decades, yet the results are rather scattered across the journal literature. This is the first book to present a unified and comprehensive survey of the subject. In addition to covering the theoretical aspects, the authors discuss a large number of applications and their generalizations to topics such as the traveling salesman problem, project scheduling, genetics, network connectivity, and sparse matrices. Numerous exercises are included. For all graduate students, researchers and professionals interested in graph theory and its applications, this book will be essential reading.

The Classification of Countable Homogeneous Directed Graphs and Countable Homogeneous $n$-tournaments

The Classification of Countable Homogeneous Directed Graphs and Countable Homogeneous $n$-tournaments
Author: Gregory L. Cherlin
Publisher: American Mathematical Soc.
Total Pages: 188
Release: 1998
Genre: Mathematics
ISBN: 9780821808368

In this book, Ramsey theoretic methods introduced by Lachlan are applied to classify the countable homogeneous directed graphs. This is an uncountable collection, and this book presents the first explicit classification result covering an uncountable family. The author's aim is to demonstrate the potential of Lachlan's method for systematic use.

Graph Classes

Graph Classes
Author: Andreas Brandstadt
Publisher: SIAM
Total Pages: 315
Release: 1999-01-01
Genre: Mathematics
ISBN: 9780898719796

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.

Handbook of Product Graphs

Handbook of Product Graphs
Author: Richard Hammack
Publisher: CRC Press
Total Pages: 537
Release: 2011-06-06
Genre: Computers
ISBN: 1439813051

This handbook examines the dichotomy between the structure of products and their subgraphs. It also features the design of efficient algorithms that recognize products and their subgraphs and explores the relationship between graph parameters of the product and factors. Extensively revised and expanded, this second edition presents full proofs of many important results as well as up-to-date research and conjectures. It illustrates applications of graph products in several areas and contains well over 300 exercises. Supplementary material is available on the book's website.

Quantitative Graph Theory

Quantitative Graph Theory
Author: Matthias Dehmer
Publisher: CRC Press
Total Pages: 516
Release: 2014-10-27
Genre: Computers
ISBN: 1466584521

The first book devoted exclusively to quantitative graph theory, Quantitative Graph Theory: Mathematical Foundations and Applications presents and demonstrates existing and novel methods for analyzing graphs quantitatively. Incorporating interdisciplinary knowledge from graph theory, information theory, measurement theory, and statistical technique

The Boost Graph Library

The Boost Graph Library
Author: Jeremy G. Siek
Publisher: Pearson Education
Total Pages: 465
Release: 2001-12-20
Genre: Computers
ISBN: 0321601610

The Boost Graph Library (BGL) is the first C++ library to apply the principles of generic programming to the construction of the advanced data structures and algorithms used in graph computations. Problems in such diverse areas as Internet packet routing, molecular biology, scientific computing, and telephone network design can be solved by using graph theory. This book presents an in-depth description of the BGL and provides working examples designed to illustrate the application of BGL to these real-world problems. Written by the BGL developers, The Boost Graph Library: User Guide and Reference Manual gives you all the information you need to take advantage of this powerful new library. Part I is a complete user guide that begins by introducing graph concepts, terminology, and generic graph algorithms. This guide also takes the reader on a tour through the major features of the BGL; all motivated with example problems. Part II is a comprehensive reference manual that provides complete documentation of all BGL concepts, algorithms, and classes. Readers will find coverage of: Graph terminology and concepts Generic programming techniques in C++ Shortest-path algorithms for Internet routing Network planning problems using the minimum-spanning tree algorithms BGL algorithms with implicitly defined graphs BGL Interfaces to other graph libraries BGL concepts and algorithms BGL classes–graph, auxiliary, and adaptor Groundbreaking in its scope, this book offers the key to unlocking the power of the BGL for the C++ programmer looking to extend the reach of generic programming beyond the Standard Template Library.

Computer Science - Theory and Applications

Computer Science - Theory and Applications
Author: Edward Hirsch
Publisher: Springer
Total Pages: 407
Release: 2014-06-02
Genre: Computers
ISBN: 3319066862

This book constitutes the proceedings of the 9th International Computer Science Symposium in Russia, CSR 2014, held in Moscow, Russia, in June 2014. The 27 full papers presented in this volume were carefully reviewed and selected from 76 submissions. In addition the book contains 4 invited lectures. The scope of the proposed topics is quite broad and covers a wide range of areas in theoretical computer science and its applications.

Finite and Infinite Combinatorics in Sets and Logic

Finite and Infinite Combinatorics in Sets and Logic
Author: Norbert W Sauer
Publisher: Springer Science & Business Media
Total Pages: 452
Release: 2012-12-06
Genre: Mathematics
ISBN: 9401120803

This volume contains the accounts of papers delivered at the Nato Advanced Study Institute on Finite and Infinite Combinatorics in Sets and Logic held at the Banff Centre, Alberta, Canada from April 21 to May 4, 1991. As the title suggests the meeting brought together workers interested in the interplay between finite and infinite combinatorics, set theory, graph theory and logic. It used to be that infinite set theory, finite combinatorics and logic could be viewed as quite separate and independent subjects. But more and more those disciplines grow together and become interdependent of each other with ever more problems and results appearing which concern all of those disciplines. I appreciate the financial support which was provided by the N. A. T. O. Advanced Study Institute programme, the Natural Sciences and Engineering Research Council of Canada and the Department of Mathematics and Statistics of the University of Calgary. 11l'te meeting on Finite and Infinite Combinatorics in Sets and Logic followed two other meetings on discrete mathematics held in Banff, the Symposium on Ordered Sets in 1981 and the Symposium on Graphs and Order in 1984. The growing inter-relation between the different areas in discrete mathematics is maybe best illustrated by the fact that many of the participants who were present at the previous meetings also attended this meeting on Finite and Infinite Combinatorics in Sets and Logic.

Combinatorial Optimization and Applications

Combinatorial Optimization and Applications
Author: Yingshu Li
Publisher: Springer Nature
Total Pages: 625
Release: 2019-12-06
Genre: Computers
ISBN: 3030364127

This volume constitutes the proceedings of the 13th International Conference on Combinatorial Optimization and Applications, COCOA 2019, held in Xiamen, China, in December 2019. The 49 full papers presented in this volume were carefully reviewed and selected from 108 submissions. The papers cover the various topics, including cognitive radio networks, wireless sensor networks, cyber-physical systems, distributed and localized algorithm design and analysis, information and coding theory for wireless networks, localization, mobile cloud computing, topology control and coverage, security and privacy, underwater and underground networks, vehicular networks, information processing and data management, programmable service interfaces, energy-efficient algorithms, system and protocol design, operating system and middleware support, and experimental test-beds, models and case studies.