Showing papers in "Information Processing Letters in 1974"

TL;DR: This note presents ent algorithm which uses any search method to And all the bridges of a graph, its maxin% connected (bridgeconnected) szbgraphs.

TL;DR: Let T(n) denote the number of arithmetic operations needed to evaluate the normalized derivatives P ^ ( t ) / i !

TL;DR: This paper analyzes the Earr icy contex*fm parsing algorithm and the impracticufity uf using a resolution-based theorem prover and a representation in first-order logic bmd on the algorithm is shown.

TL;DR: In this article, a tree-generation algorithm for cyclic graphs is presented, which, exploiting a canonical-lexical notational system, constructs the complete set of solutions in canonically increasing order, without redundancy.