Now showing items 1-6 of 6
Parallel Algorithms for Graph Problems
Due to the constraints of parallel computation environment, efficient parallel algorithms often drastically differ from their sequential counterparts. The study of parallel computation often leads to the discovery of new ...
Parallel Algorithm for Special Graphs
This project is concerned with the design of efficient parallel algorithms for solving various graph problems arising from disparate areas in Computer Science. These problems can be roughly divided into three categories: ...
Graph Encodings, Embeddings, Labelings and Applications
In all graph algorithms, graphs are encoded by binary strings.<br/>The problem of encoding graphs by binary strings is a fundamental<br/>problem in computer science. To be useful in graph algorithms,<br/>an ...
Algorithms and Applications of Planar Graphs and Planar Meshes
The class of planar graphs and planar meshes is a well-studied graph class. It has been a driving force in the field of graph algorithms. Although it has been the research subject in graph theory and algorithm design for ...
Graph Orientations and Applications
Given a graph G=(V,E), an orientation O of G is an assignment<br/>of directions to the edges of G. We may require that certain<br/>properties must be satisfied by O. Varying the requirements,<br/>different ...
AF: Small: Efficient Algorithms for Rectangular Layouts and Cartograms
A "rectangular layout" L is a partition of a rectangle into a set of disjoint smaller rectangles by vertical and horizontal line segments. L is said to "represent a graph G" if the smaller rectangles ...