Classes of Directed Graphs, Softcover reprint of the original 1st ed. 2018 Springer Monographs in Mathematics Series
Coordonnateurs : Bang-Jensen Jørgen, Gutin Gregory
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.
Jørgen Bang-Jensen is a professor in the Department of Mathematics and Computer science at the University of Southern Denmark, Odense, Denmark.
Gregory Gutin is Professor of Computer Science at Royal Holloway College, University of London, UK.
Presents the latest research in the subject area, including significant new results obtained over recent years
Illustrates various approaches, techniques and algorithms used in digraph theory
Explores structural results as well as algorithms and complexity, including results on fixed parameter tractability
Collects over 120 open problems and conjectures
Date de parution : 01-2019
Ouvrage de 636 p.
15.5x23.5 cm
Date de parution : 07-2018
Ouvrage de 636 p.
15.5x23.5 cm
Thèmes de Classes of Directed Graphs :
Mots-clés :
directed graphs; directed graphs classes; tournaments generalizations; planar digraphs; acyclic digraphs; Euler digraphs; directed width parameters; graph products; orientations of graphs; graph connectivity; disjoint paths; graph branchings; hamiltonian paths; hamiltonian cycles; feedback sets; algorithm analysis and problem complexity