A searching algorithm for finite embedded D-graphs with no more than k regions

Armin Hemmerling. A searching algorithm for finite embedded D-graphs with no more than k regions. Bulletin of the EATCS, 24:78-84, 1984.

Abstract

Abstract is missing.