Comparing the expressibility of two languages formed using NP-complete graph operators.

Iain A. Stewart

Browse the full WG paper archive.