Year: 1986
Type: dissertation
Abstract: In a recent paper, Bern, Lawler and Wong described a uniform theory for developing linear time algorithms which find optimal subgraphs obeying certain properties called regular in certain families of graphs called k-terminal recursive.In this thesis, the theory is generalized to non-regular properties for k-terminal recursive graphs.Algorithms for constructing the tables on which the linear time algorithms operate are developed for regular properties which are local.The linear time sequential algorithms are adapted to yield O(1og n) time parallel algorithms which use O(n) processors on a CRCW (concurrent-read-concurrent-write) PRAM.
Source: Summit (Simon Fraser University)
Author: Sanjeev Mahajan
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
Funder: Simon Fraser University
OpenAlex ID: W2116207461