Algorithms on trees and graphs
Graph theory is a mathematical subject with applications to disciplines such as computer science, computational molecular biology, and computational chemistry. The author's goal is to provide material suitable for graduate level courses on algorithmic graph theory for students familiar with some basic facts on discrete mathematics, data structures, and programming. The book goes beyond classical graph problems and addresses algorithmic problems with practical applications. The book is structured around the fundamental problem of isomorphism. The algorithms are presented on intuitive basis, followed by a detailed exposition in a literate programming style. Further, full C++ implementation of all the algorithms using the LEDA library is given. Interactive demonstration including animations of all the algorithms with LEDA is available on the book's web site, together with source code. Apparently, books providing extensive software support will have a great potential in the hands of a dedicated teacher who is both willing and capable of using the software. Because much of the material in the book was previously only available in specialized research literature, this book will be very valuable also for researchers of algorithmic graph theory. This richly illustrated book has an extensive bibliography and several appendices describing the software.
- Learning grammars for architecture-specific facade parsing
- An inductive characterization of matching in binding bigraphs
- Mining frequent closed rooted trees
- Finding multi-objective supported efficient spanning trees
- Isomorphic unordered labeled trees up to substitution ciphering
- On the complexity of finding a largest common subtree of bounded degree
- Approximating tree edit distance through string edit distance
- Tai mapping hierarchy for rooted labeled trees through common subforest
- An algebraic view of the relation between largest common subtrees and smallest common supertrees
- Constrained tree inclusion
- Decomposition algorithms for the tree edit distance problem
- Tree structure for contractible regions in \(\mathbb R^{3}\)
- Geometric partitioning and robust ad-hoc network design
- Matching of bigraphs
- On the power of color refinement
- Modeling synergies in multi-criteria supplier selection and order allocation: an application to commodity trading
- ON THE MAXIMUM NUMBER OF PERIOD ANNULI FOR SECOND ORDER CONSERVATIVE EQUATIONS
- Algorithms on Subtree Filament Graphs
- Graph theory for programmers. Algorithms for processing trees
- Counting weighted independent sets beyond the permanent
- Largest Weight Common Subtree Embeddings with Distance Penalties
- A guide to graph algorithms
- Determining the Hausdorff distance between trees in polynomial time
- Algorithms on Trees and Graphs
- A note on trees, tables, and algorithms
- \(m\)-potent elements in order-preserving transformation semigroups and ordered trees.
- Enumeration of viral capsid assembly pathways: tree orbits under permutation group action
- Solving subgraph isomorphism problems with constraint programming
- On the hardness of computing the edit distance of shallow trees
- Guarding a set of line segments in the plane
- The Bourque distances for mutation trees of cancers
- Learning driven three-phase search for the maximum independent union of cliques problem
- Polynomial-delay generation of functional digraphs up to isomorphism
- Tree-layout based graph classes: proper chordal graphs
- Asymptotic post-selection inference for regularized graphical models
- The strong vertex span of trees
- Finding maximal leaf-agreement isomorphic descendent subtrees from phylogenetic trees with different species
- Comparing similar ordered trees in linear-time
- An efficient strategy for generating all descendant subtree patterns from phylogenetic trees with its implementation
This page was built for publication: Algorithms on trees and graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4779780)
