Abstract:
Using a previously developed algebraic representation system for graphs of bounded pathwidth and treewidth, efficient membership algorithms are built for subgraph, minor and topological- minor partial orders. Semi-automatic procedures for these problems are presented through numerous explanatory figures and source code. An enumeration scheme for building membership automata for fixed graph substructures of graphs of bounded width will also be introduced.
