DocumentCode
2932076
Title
Current Research on Planar Graphs
Author
Rahman, Md Saidur
Author_Institution
Dept. of Comput. Sci. & Eng., Bangladesh Univ. of Eng. & Technol. (BUET), Dhaka
fYear
2007
fDate
7-9 March 2007
Firstpage
148
Lastpage
149
Abstract
A graph consists of a set of vertices and a set of edges, each joining two vertices. A graph is planar if it can be embedded in the plane so that no two edges intersect geometrically except at a vertex to which they are both incident. A plane graph is a planar graph with a fixed embedding. Planar graphs have attracted computer scientists´ interest due to their enormous applications, and a lot of interesting algorithms and complexity results have been obtained for planar graphs. In this talk we survey the results on planar graphs.
Keywords
computational complexity; directed graphs; geometry; digraph; face-spanning subgraph problem; geometry; planar graphs; polynomial time algorithm; straight-line drawing; Application software; Binary trees; Computer science; Engineering drawings; Grid computing; Polynomials; Testing; Tree graphs; Very large scale integration; Visualization;
fLanguage
English
Publisher
ieee
Conference_Titel
Information and Communication Technology, 2007. ICICT '07. International Conference on
Conference_Location
Dhaka
Print_ISBN
984-32-3394-8
Type
conf
DOI
10.1109/ICICT.2007.375362
Filename
4261385
Link To Document