Back to search

Rochester Institute of Technology

Solving Hard Graph Problems with Combinatorial Computing and Optimization

Abstract

dc:description.abstract

Many problems arising in graph theory are difficult by nature, and finding solutions to large or complex instances of them often require the use of computers. As some such problems are $NP$-hard or lie even higher in the polynomial hierarchy, it is unlikely that efficient, exact algorithms will solve them. Therefore, alternative computational methods are used. Combinatorial computing is a branch of mathematics and computer science concerned with these methods, where algorithms are developed to generate and search through combinatorial structures in order to determine certain properties of them. In this thesis, we explore a number of such techniques, in the hopes of solving specific problem instances of interest. Three separate problems are considered, each of which is attacked with different methods of combinatorial computing and optimization. The first, originally proposed by ErdH{o}s and Hajnal in 1967, asks to find the Folkman number Fe(3,3;4), defined as the smallest order of a K4-free graph that is not the union of two triangle-free graphs. A notoriously difficult problem associated with Ramsey theory, the best known bounds on it prior to this work were 19 leq Fe(3,3;4) leq 941. We improve the upper bound to Fe(3,3;4) leq 786 using a combination of known methods and the Goemans-Williamson semi-definite programming relaxation of MAX-CUT. The second problem of interest is the Ramsey number R(C4,Km), which is the smallest $n$ such that any $n$-vertex graph contains a cycle of length four or an independent set of order $m$. With the help of combinatorial algorithms, we determine R(C4,K9)=30 and R(C4,K10)=36 using large-scale computations on the Open Science Grid. Finally, we explore applications of the well-known Lenstra-Lenstra-Lov'{a}sz (LLL) algorithm, a polynomial-time algorithm that, when given a basis of a lattice, returns a basis for the same lattice with relatively short vectors. The main result of this work is an application to graph domination, where certain hard instances are solved using this algorithm as a heuristic.

Degree

thesis:*
Name thesis:degree_name
Computer Science (MS)
Level thesis:degree_level
Thesis
Discipline thesis:degree_discipline
Computer Science (GCCIS)

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Lange, Alexander R
Contributors dc:contributor
  • Stanislaw Radziszowski

Subjects

dc:subject × 6

Identifiers

dc:identifier.*
Repository record dc:identifier
https://repository.rit.edu/theses/5946

Chain of custody

source
Harvested from
Rochester Institute of Technology
Base URL
repository.rit.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Lange, Alexander R. Solving Hard Graph Problems with Combinatorial Computing and Optimization. Thesis thesis, https://repository.rit.edu/theses/5946