In this paper, we consider a large class of vertex partitioning problems and apply to them the theory of algorithm design for problems restricted to partial k-trees. We carefully describe the detailsâ€¦ (More)

Wc show how membership in classes of graphs definable m monwhc second-order ]oglc and of bounded treewldth can be decided by finite sets of terminating reduction rules. The method is constructive inâ€¦ (More)

A k-tree is formed from a k-complete graph by recursively adding a vertex adjacent to all vertices in an existing k-complete subgraph. The many applications of partial k-trees (subgraphs of k-trees)â€¦ (More)

A covering projection from a graph G onto a graph H is a \local isomorphism": a mapping from the vertex set of G onto the vertex set of H such that, for every v 2 V (G), the neighborhood of v isâ€¦ (More)

A graph is self-repairing if it is 2-connected and such that the removal of any single vertex results in no increase in distance between any pair of remaining vertices of the graph. We completelyâ€¦ (More)

Let T(n) denote the set of all bitstrings with n 1's and n 0's that satisfy the property that in every preex the number of 0's does not exceed the number of 1's. This is a well known representationâ€¦ (More)

We consider a model of communication in a network, where multiple sources have messages to disseminate among the network membership. We propose that all the messages (one from each source) beâ€¦ (More)

We give eecient algorithms for listing equivalence classes of k-ary strings under reversal and permutation of alphabet symbols. As representative of each equivalence class we choose that string whichâ€¦ (More)