Delne risbe polnih grafov

Abstract

Keywords

Data

Language:	Slovenian
Year of publishing:	2014
Typology:	2.11 - Undergraduate Thesis
Organization:	UL FRI - Faculty of Computer and Information Science
Publisher:	[M. Lalović]
UDC:	004(043.2)
COBISS:	10785108
Views:	78
Downloads:	9
Average score:	0 (0 votes)
Metadata:

Other data

Secondary language:	English
Secondary title:	Partial edge drawings of complete graphs
Secondary abstract:	Partial edge drawing of a graph is a rectilinear drawing in which a middle portion of an edge is removed from the drawing. In addition, we require that the drawing is without edge crossings. Currently, the best estimate claims that there is no partial edge drawing of the complete graph on 241 or more points. In this work we improve the estimate by a factor of more than two. We show that it is not possible to draw a partial edge drawing of the complete graph on 102 or more points. The main ideas are two. On the one hand, we use a different division of the plane on which the points of the graph are located. Instead of coordinate division of the plane, we use the areas along the rays from pre-selected points of the drawing. On the other hand, we analyze the whole drawing of the graph by the location of three, sometimes even four, points of the drawing and not only two points as in the previous estimates.
Secondary keywords:	partial edge drawings;graph theory;planar graphs;analytic geometry;computer science;computer and information science;computer science and mathematics;interdisciplinary studies;diploma;
File type:	application/pdf
Type (COBISS):	Bachelor thesis/paper
Study programme:	1000407
Thesis comment:	Univerza v Ljubljani, Fak. za računalništvo in informatiko
Pages:	74 str.
ID:	8739343