Topics in combinatorics and algorithms

This thesis studies several topics in theoretical computer science. First, the author shows that $5n-4$ is a tight lower bound on the number of edges in the visibility graph of n non-intersecting line segments in the plane.

Name thesis:degree_name

Ph.D.

Level thesis:degree_level

Dissertation

Discipline thesis:degree_discipline

Computer Science

Grantor

University of Illinois at Urbana-Champaign

Year dc:date

2011

Author dc:creator

• Shen, Xiaojun

Contributors dc:contributor

• Liu, C.L.

• Mathematics
• Computer Science

Statement dc:rights

• Copyright 1989 Shen, Xiaojun

Language dc:language

eng

Identifier

AAI9011017
(UMI)AAI9011017

OAI identifier oai:identifier

oai:www.ideals.illinois.edu:2142/21655