Efficient Algorithms for Graph-Theoretic and Geometric Problems

This thesis studies several different algorithmic problems in graph theory and in geometry. The applications of the problems studied range from circuit design optimization to fast matrix multiplication. First, we study a graph-theoretical model of the so called ''firefighter problem''. The objective is to save as much as possible of an area by appropriately placing firefighters. We provide both new exact algorithms for the case of general graphs as well as approximation algorithms for the case of planar graphs. Next, we study drawing graphs within a given polygon in the plane. We present asymptotically tight upper and lower bounds for this problem Further, we study the problem of Subgraph Isormorphism, which amounts to decide if an input graph (pattern) is isomorphic to a subgraph of another input graph (host graph). We show several new bounds on the time complexity of detecting small pattern graphs. Among other things, we provide a new framework for detection by testing polynomials for non-identity with zero. Finally, we study the problem of partitioning a 3D histogram into a minimum number of 3D boxes and it's applications to efficient computation of matrix products for positive integer matrices. We provide an efficient approximation algorithm for the partitioning problem and several algorithms for integer matrix multiplication. The multiplication algorithms are explicitly or implicitly based on an interpretation of positive integer matrices as 3D histograms and their partitions.

Grantor dc:publisher

Centre for Mathematical Sciences, Lund University

Year dc:date

2015

Author dc:creator

• Floderus, Peter

• Mathematical Sciences

Statement dc:rights

• info:eu-repo/semantics/openAccess

Language dc:language

eng

Identifier

urn:isbn:978-91-7623-277-4

OAI identifier oai:identifier

oai:lup.lub.lu.se:0cbbe777-6a7b-4e82-bbc2-87c639e6678a