Browsing Computer Science and Automation (CSA) by thesis submitted date"1989"
Now showing items 1-2 of 2
-
Algorithms for testing planarity of chordal graphs and hamiltonicity of planar chordal graphs.
Design and analysis of graph algorithms is an active research area in Computer Science. Designing efficient algorithms for graph problems is both challenging and rewarding from the point of view of theory and applications. ... -
A Compiler and Symbolic Debugger for Occam
(Indian Institute of Science, 2005-03-03)We have implemented Occam, a parallel programming language, on a uniprocessor machine (MC-68020 based HORIZON I11 running on UNIX system V.2) with simulated concurrency. Occam is a descendant of CSP with a few convenient ...