an:00681641
Zbl 0822.68084
Mahajan, Sanjeev; Peters, Joseph G.
Regularity and locality in \(k\)-terminal graphs
EN
Discrete Appl. Math. 54, No. 2-3, 229-250 (1994).
00022489
1994
j
68R10 05C05 05C78
regular graph properties; \(k\)-terminal recursive graphs; parse tree; linear-time algorithm
Summary: \textit{M. W. Bern}, \textit{E. L. Lawler} and \textit{A. L. Wong} J. Algorithms 8, 216-235 (1987; Zbl 0618.68058) described a general method for constructing algorithms to find an optimal subgraph in a given graph. When the given graph is a member of a \(k\)-terminal recursive family of graphs and is presented in the form of a parse tree, and when the optimal subgraph satisfies a property that is regular with respect to the family of graphs, then the method produces a linear-time algorithm. The algorithms assume the existence of multiplication tables that are specific to the regular property and to the family of graphs. In this paper we show that the general problem of computing these multiplication tables is unsolvable and provide a ``pumping'' lemma for proving that particular properties are not regular for particular \(k\)-terminal families. In contrast with these negative results, we show that all local properties, that can be verified by examining a bounded neighbourhood of each vertex in a graph, are regular with respect to all \(k\)-terminal recursive families of graphs, and we show how to automate the construction of the multiplication tables for any local property.
Zbl 0618.68058