#### Date of Award

1990

#### Document Type

Dissertation

#### Degree Name

Doctor of Philosophy (PhD)

#### Department

Computer Science

#### First Advisor

Sitharama S. Iyengar

#### Abstract

The quest for efficient parallel algorithms for graph related problems necessitates not only fast computational schemes but also requires insights into their inherent structures that lend themselves to elegant problem solving methods. Towards this objective efficient parallel algorithms on a class of hypergraphs called acyclic hypergraphs and directed hypergraphs are developed in this thesis. Acyclic hypergraphs are precisely chordal graphs and their subclasses, and they have applications in relational databases and computer networks. In this thesis, first, we present efficient parallel algorithms for the following problems on graphs. (1) determining whether a graph is strongly chordal, ptolemaic, or a block graph. If the graph is strongly chordal, determine the strongly perfect vertex elimination ordering. (2) determining the minimal set of edges needed to make an arbitrary graph strongly chordal, ptolemaic, or a block graph. (3) determining the minimum cardinality dominating set, connected dominating set, total dominating set, and the domatic number of a strongly chordal graph. Secondly, we show that the query implication problem ($Q\sb1\ \to\ Q\sb2$) on two queries, which is to determine whether the data retrieved by query $Q\sb1$ is always a subset of the data retrieved by query $Q\sb2$, is not even in NP and in fact complete in $\Pi\sb2\sp{p}$. We present several 'fine-grain' analyses of the query implication problem and show that the query implication can be solved in polynomial time given chordal queries. Thirdly, we develop efficient parallel algorithms for manipulating directed hypergraphs H such as finding a directed path in H, closure of H, and minimum equivalent hypergraph of H. We show that finding a directed path in a directed hypergraph is inherently sequential. For directed hypergraphs with fixed degree and diameter we present NC algorithms for manipulations. Directed hypergraphs are representation schemes for functional dependencies in relational databases. Finally, we also present an efficient parallel algorithm for multi-dimensional range search. We show that a set of points in a rectangular parallelepiped can be obtained in O(logn) time with only 2.log$\sp2 n$ $-$ 10.logn + 14 processors on a EREW-PRAM. A nontrivial implementation technique on the hypercube parallel architecture is also presented. Our method can be easily generalized to the case of d-dimensional range search.

#### Recommended Citation

Radhakrishnan, Sridhar, "Fast Parallel Algorithms on a Class of Graph Structures With Applications in Relational Databases and Computer Networks." (1990). *LSU Historical Dissertations and Theses*. 5018.

https://digitalcommons.lsu.edu/gradschool_disstheses/5018

#### Pages

164