Rifat planar draw bipartite G

PLANAR DRAWINGS OF BIPARTITE GRAPHS BY
ELIMINATING MINIMUM NUMBER OF EDGES

MUHAMMAD OARISUL HASAN RIFAT

Department of Computer Science and Engineering
Chittagong University of Engineering & Technology (CUET),
Chittagong-4349, Bangladesh.

PLANAR DRAWINGS OF BIPARTITE GRAPHS BY
ELIMINATING MINIMUM NUMBER OF EDGES

A thesis is submitted in partial fulfillment of the requirements for the degree of Science in
Computer Science and Engineering.

By
Muhammad Oarisul Hasan Rifat
(0404054)

Supervised by
A H M Ashfak Habib
Assistant Professor, Dept. of CSE
CUET, Bangladesh.

Department of Computer Science and Engineering
Chittagong University of Engineering & Technology (CUET),
Chittagong-4349, Bangladesh.

The thesis titled Planar Drawings of Bipartite Graph by Eliminating Minimum
Number of Edges submitted by Roll No: 0404054 Session 2007-2008 has been accepted as satisfactory in fulfillment of the requirement for the degree of Bachelor of Science in
Computer Science and Engineering(B.Sc. Engg) in Chittagong University of Engineering and Technology.

Board of Examiners

1.
A H M Ashfak Habib

Chairman

Assistant Professor,
Department of Computer Science and Engineering (CSE)
Chittagong University of Engineering and Technology (CUET)
Chittagong 4349, Bangladesh.

2.
Prof. Dr. Md. Tazul Islam

Member

Department of Computer Science and Engineering (CSE)

(Ex-officio)

Chittagong University of Engineering and Technology (CUET)
Chittagong 4349, Bangladesh.

3. iii Candidate’s Declaration

It is hereby declared that the contents of this thesis is original and any part of it has not been submitted elsewhere for the award if any degree or diploma.

Signature of the Supervisor

Signature of the Candidate

Date:

Date:

iv

Contents
Board of Examiner

iii

Candidate’s Declaration

vi

Acknowledgments

x

Abstract

xi

1

2

Introduction ………………………………………………………………..

1

1.1 Graph and Graph Drawing …………………………………………

1

1.2 Graph Drawing Conventions ………………………………………

2

1.2.1