A central problem in computational and evolutionary biology is the inference of phylogenetic tree from a set of triplets or quartets. Researchers try to construct phylogenetic tree by com¬bining many triplets or quartets ...

This thesis deals with polyline grid drawings of planar graphs. A polyline drawing of a planar graph is a drawing of the graph where each vertex is drawn on a grid point and each edge is drawn by a polygonal chain. A point ...

A graph G = (V,E) is called a pairwise compatibility graph (PCG) if there exists an edge-weighted tree T and two non-negative real numbers dmin and dmax such that each leaf u of T corresponds to a vertex u ∈ V and there ...

Generating all triangulations of graphs and polygons have many applications in Computational Geometry, VLSI Floorplaning and Graph Drawing. In this thesis, we deal with the problem of generating all triangulations of ...

In a straight line drawing of a planar graph each vertex is drawn as a point and each edge is drawn as a straight line segment. One of the important aesthetic criteria for a straight line drawing is to minimize the number ...

This thesis deals with pairwise compatibility graphs. Let T be an edge weighted tree, let dT (u, v) be the sum of the weights of the edges on the path from u to v in T, and let dmin and dmax be two non-negative real ...

This thesis deals with orthogonal drawings of plane graphs. Orthogonal drawings have numerous practical applications in different fields of science and technology. In an orthogonal drawing of a plane graph, each vertex ...

Numerous applications of resource partitioning have been found in electrical power distribution systems, telecommunication networks, computer networks, fault tolerant systems, grid computing etc. The resource partitioning ...

This thesis deals with area efficient straight-line drawings of planar graphs. It is well known that a planar graph of n vertices admits a straight-line grid drawing on a grid of area O(n2 ). A lower bound of n(n2) on ...