122 research outputs found
Graph Arrowing: Constructions and Complexity
Graph arrowing is concerned with determining which monochromatic subgraphs are unavoidable when coloring a given graph. There are two main avenues of research concerning arrowing: finding extremal Ramsey/Folkman graphs and categorizing the complexity of arrowing problems. Both avenues have been studied extensively for decades. In this thesis, we focus on graph arrowing problems where one of the monochromatic subgraphs being avoided is the path on three vertices, denoted as P3. Our main contributions involve computing Folkman numbers by generating graphs up to 13 vertices and proving the coNP-completeness of some arrowing problems using a novel reduction framework geared towards avoiding P3\u27s. The (P3,H)-Arrowing Problem asks whether a given graph can be colored using two colors (red and blue) such that there are no red P3\u27s and no blue H\u27s, where H is a fixed graph. The few previous hardness proofs for arrowing problems relied on ad-hoc, laborious constructions of gadgets. We introduce a general framework that can be used to prove the coNP-completeness of (P3,H)-arrowing problems. We search for gadgets computationally. These gadgets allow us to simulate variants of SAT, thus showing coNP-hardness. Finally, we use our (P3,H)-Arrowing hardness reductions to gain insight into variants of Monotone SAT. For fixed k in {4,5,6}, we show that Monotone SAT remains NP-complete under the following constraints: 1) each clause consists of exactly two unnegated literals or exactly k negated literals, 2) the variables in each clause are distinct, and 3) the number of times a variable occurs in the formula is bounded by a constant. For future work, we expect that the insight gained by our computationally assisted reductions will help us prove the complexity of other elusive arrowing problems
Some Multicolor Ramsey Numbers Involving Cycles
Establishing the values of Ramsey numbers is, in general, a difficult task from the computational point of view. Over the years, researchers have developed methods to tackle this problem exhaustively in ways that require intensive computations. These methods are often backed by theoretical results that allow us to cut the search space down to a size that is within the limits of current computing capacity.
This thesis focuses on developing algorithms and applying them to generate Ramsey colorings avoiding cycles. It adds to a recent trend of interest in this particular area of finite Ramsey theory. Our main contributions are the enumeration of all (C_5,C_5,C_5;n) Ramsey colorings and the study of the Ramsey numbers R(C_4,C_4,K_4) and R4(C_5)
Exact bounds for distributed graph colouring
A distributed system is a collection of networked autonomous processing units which must work in a cooperative manner. Currently, large-scale distributed systems, such as various telecommunication and computer networks, are abundant and used in a multitude of tasks. The field of distributed computing studies what can be computed efficiently in such systems.
Distributed systems are usually modelled as graphs where nodes represent the processors and edges denote communication links between processors. This thesis concentrates on the computational complexity of the distributed graph colouring problem. The objective of the graph colouring problem is to assign a colour to each node in such a way that no two nodes connected by an edge share the same colour. In particular, it is often desirable to use only a small number of colours. This task is a fundamental symmetry-breaking primitive in various distributed algorithms. A graph that has been coloured in this manner using at most k different colours is said to be k-coloured.
This work examines the synchronous message-passing model of distributed computation: every node runs the same algorithm, and the system operates in discrete synchronous communication rounds. During each round, a node can communicate with its neighbours and perform local computation. In this model, the time complexity of a problem is the number of synchronous communication rounds required to solve the problem.
It is known that 3-colouring any k-coloured directed cycle requires at least ½(log* k - 3) communication rounds and is possible in ½(log* k + 7) communication rounds for all k ≥ 3. This work shows that for any k ≥ 3, colouring a k-coloured directed cycle with at most three colours is possible in ½(log* k + 3) rounds. In contrast, it is also shown that for some values of k, colouring a directed cycle with at most three colours requires at least ½(log* k + 1) communication rounds. Furthermore, in the case of directed rooted trees, reducing a k-colouring into a 3-colouring requires at least log* k + 1 rounds for some k and possible in log* k + 3 rounds for all k ≥ 3.
The new positive and negative results are derived using computational methods, as the existence of distributed colouring algorithms corresponds to the colourability of so-called neighbourhood graphs. The colourability of these graphs is analysed using Boolean satisfiability (SAT) solvers. Finally, this thesis shows that similar methods are applicable in capturing the existence of distributed algorithms for other graph problems, such as the maximal matching problem
Treewidth-aware Reductions of Normal ASP to SAT -- Is Normal ASP Harder than SAT after All?
Answer Set Programming (ASP) is a paradigm for modeling and solving problems
for knowledge representation and reasoning. There are plenty of results
dedicated to studying the hardness of (fragments of) ASP. So far, these studies
resulted in characterizations in terms of computational complexity as well as
in fine-grained insights presented in form of dichotomy-style results, lower
bounds when translating to other formalisms like propositional satisfiability
(SAT), and even detailed parameterized complexity landscapes. A generic
parameter in parameterized complexity originating from graph theory is the
so-called treewidth, which in a sense captures structural density of a program.
Recently, there was an increase in the number of treewidth-based solvers
related to SAT. While there are translations from (normal) ASP to SAT, no
reduction that preserves treewidth or at least keeps track of the treewidth
increase is known. In this paper we propose a novel reduction from normal ASP
to SAT that is aware of the treewidth, and guarantees that a slight increase of
treewidth is indeed sufficient. Further, we show a new result establishing
that, when considering treewidth, already the fragment of normal ASP is
slightly harder than SAT (under reasonable assumptions in computational
complexity). This also confirms that our reduction probably cannot be
significantly improved and that the slight increase of treewidth is
unavoidable. Finally, we present an empirical study of our novel reduction from
normal ASP to SAT, where we compare treewidth upper bounds that are obtained
via known decomposition heuristics. Overall, our reduction works better with
these heuristics than existing translations
Research in Applied Mathematics, Fluid Mechanics and Computer Science
This report summarizes research conducted at the Institute for Computer Applications in Science and Engineering in applied mathematics, fluid mechanics, and computer science during the period October 1, 1998 through March 31, 1999
- …