DSpace Repository

Browsing Dissertation/Theses - Department of Computer Science and Engineering by Subject "Graph theory"

Browsing Dissertation/Theses - Department of Computer Science and Engineering by Subject "Graph theory"

Sort by: Order: Results:

  • Algorithms for polyline drawings of plane 3-trees 
    Hussain, Md. Khaled (Department of computer Science and Engineering, 2019-03-30)
    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 ...
  • Box - rectangular drawings of planar graphs 
    Manzurul Hasan, Md. (Department of Computer Science and Engineering (CSE), 2012-06)
    A plane graph is a planar graph with a fixed embedding in the plane. In a box- rectangular drawing of a plane graph, every vertex is drawn as a rectangle, called a box, each edge is drawn as either a horizontal line ...
  • Efficient algorithms for geometric representations of graphs 
    Sultana, Shaheena (Department of Computer Science and Engineering, 2018-02-28)
    Agraphconsistsofasetofverticesandasetofedges,eachjoiningtwovertices.Age-ometricrepresentationofagraphisarepresentationofthegraphinwhichtheverticesandedgesarerepresentedbygeometricobjects.Visibilityrepresentations,orthogo ...
  • Minimum segment drawings of outerplanar graphs 
    Abdullah Adnan, Muhammad (Department of Computer Science and Engineering, BUET, 2008-12)
    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 ...
  • Minimum segment drawings of series-parallel graphs with the maximum degree three 
    Abul Hassan Samee, Md. (Department of Computer Science and Engineering, BUET, 2008-07)
    This thesis deals with minimum segment drawings of planar graphs. A minimum segment drawing of a planar graph G is a planar straight line drawing of G that has the minimum number of line segments among all possible planar ...
  • Point - set embeddings of planar graphs with fewer bends 
    Emran Chowdhury, Md. (Department of Computer Science and Engineering (CSE), 2010-12)
    An upward point-set embedding of an upward planar digraph G on a set of points S with a mapping © : V (G) → S is a drawing ¡ of G where each vertex of G is placed on a point of S according to ©, each edge is drawn upward ...
  • Spanning paths, cycles and trees: problems and results 
    Sohel Rahman, Mohammad (Department of Computer Science and Engineering, BUET, 2004-01)
    This thesis deals with the classical graph theoretic structures- spanning paths, cycles and trees. We here present new sufficient conditions for a graph to possess Hamiltonian (spanning) paths. New sufficient conditions ...
  • Straight-line drawings of planar graphs with constraints 
    Iqbal Hossain, Md. (Department of Computer Science and Engineering (CSE), 2015-11)
    This thesis deals with straight-line drawings of planar graphs with some constraints. Usually various constraints are imposed on the drawings of planar graphs to meet the requirements of the application areas like VLSI ...
  • Straight-Line grid drawings of planar graphs with sub-Quadratic area 
    Rezaul Karim, Md. (Department of Computer Science and Engineering, BUET, 2008-11)
    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 ...
  • Study on graceful labeling of trees 
    Jannatul Maowa (Department of Computer Science and Engineering (CSE), 2016-07)
    A tree is a connected acyclic graph on n vertices and n􀀀1 edges. Graceful labeling of a tree is a labeling of its vertices with the numbers from 0 to n􀀀1, so that no two vertices share a label, labels of edges, being ...

Search BUET IR


Advanced Search

Browse

My Account