Simulation of a tree processor /

Thesis (M. S.)--University of Illinois at Urbana-Champaign.

Two upper bounds for the weighted path length of binary trees.

Thesis (M.S.)--University of Illinois at Urbana-Champaign.

Picture analysis by graph transformation,

"Supported in part by the Department of Computer Science and the Atomic Energy Commission under contract US AEC AT(11-1)2118."

A generalization of Ramsey theory for graphs, with stars and complete graphs as forbidden subgraphs /

Includes bibliographical references.

On algorithms for finding all circuits of a graph

Bibliography: p. [37]-[39]

A generalization of Ramsey theory for graphs /

Bibliography: p. 16.

A graph-structure transformation model for picture parsing,

"COO-2118-0031."

A switching theory for bilateral nets of threshold elements.

Issued also as thesis, University of Illinois.

A generalization of Ramsey theory for graphs /

Includes bibliographical references.

Deficient generalized Fibonacci maximum path graphs /

"UILU-ENG 78 1739."

Generalized Ramsey numbers for stars /

"UIUCDCS-R-81-1050"--Cover.

Weak congruence relations on graphs /

Vita.

Parallel algorithms for network routing problems and recurrences /

"Grant no. US NSF MCS75-21758."

A tricolor cartograph,

"COO-1469-0102."

Average analysis of simple path algorithms /

"UILU-ENG 77 1759."