HansL.Bodlaender andFedorV.Fomin Approximationofpathwidthofouterplanargraphs

In particular, we show that given an n-vertex graph G together with its set of potential maximal cliques, and an integer t, it is possible in time the number of potential

Tree matching can be modeled as a bipartite graph matching problem, where G is a graph, with two disjoint node sets, P and Q, corresponding to the branch sets A and B of the source