This paper introduces a new class of games called symmetric complementing games. These games are interesting since their related complexity classes include many well-known graph problems: Finding mlmmum spanning forests; k-connectiwty and k-blocks; and recognition of chordal graphs, comparabdity graphs, interval graphs, spht graphs, permutation graphs, and constant valence planar graphs. For these problems probabihstlc sequential algorithms requiring simultaneously logarithmic space and polynomial time are given Furthermore, probabfllsUc parallelism algorithms requiring simultaneously loganthmic time and a polynomml number of processors are also given. © 1984, ACM. All rights reserved.
Volume / Issue
Start / End Page
Electronic International Standard Serial Number (EISSN)
International Standard Serial Number (ISSN)
Digital Object Identifier (DOI)