111 research outputs found
The Complexity of Surjective Homomorphism Problems -- a Survey
We survey known results about the complexity of surjective homomorphism
problems, studied in the context of related problems in the literature such as
list homomorphism, retraction and compaction. In comparison with these
problems, surjective homomorphism problems seem to be harder to classify and we
examine especially three concrete problems that have arisen from the
literature, two of which remain of open complexity
Surjective H-Colouring over reflexive digraphs
The Surjective H-Colouring problem is to test if a given graph allows a vertex-surjective homomorphism to a fixed graph H. The complexity of this problem has been well studied for undirected (partially) reflexive graphs. We introduce endo-triviality, the property of a structure that all of its endomorphisms that do not have range of size 1 are automorphisms, as a means to obtain complexity-theoretic classifications of Surjective H-Colouring in the case of reflexive digraphs. Chen (2014) proved, in the setting of constraint satisfaction problems, that Surjective H-Colouring is NP-complete if H has the property that all of its polymorphisms are essentially unary. We give the first concrete application of his result by showing that every endo-trivial reflexive digraph H has this property. We then use the concept of endo-triviality to prove, as our main result, a dichotomy for Surjective H-Colouring when H is a reflexive tournament: if H is transitive, then Surjective H-Colouring is in NL; otherwise, it is NP-complete. By combining this result with some known and new results, we obtain a complexity classification for Surjective H-Colouring when H is a partially reflexive digraph of size at most 3
Graph Algorithms and Complexity Aspects on Special Graph Classes
Graphs are a very flexible tool within mathematics, as such, numerous problems can be solved by formulating them as an instance of a graph. As a result, however, some of the structures found in real world problems may be lost in a more general graph. An example of this is the 4-Colouring problem which, as a graph problem, is NP-complete. However, when a map is converted into a graph, we observe that this graph has structural properties, namely being (K_5, K_{3,3})-minor-free which can be exploited and as such there exist algorithms which can find 4-colourings of maps in polynomial time.
This thesis looks at problems which are NP-complete in general and determines the complexity of the problem when various restrictions are placed on the input, both for the purpose of finding tractable solutions for inputs which have certain structures, and to increase our understanding of the point at which a problem becomes NP-complete.
This thesis looks at four problems over four chapters, the first being Parallel Knock-Out. This chapter will show that Parallel Knock-Out can be solved in O(n+m) time on P_4-free graphs, also known as cographs, however, remains hard on split graphs, a subclass of P_5-free graphs. From this a dichotomy is shown on -free graphs for any fixed integer .
The second chapter looks at Minimal Disconnected Cut. Along with some smaller results, the main result in this chapter is another dichotomy theorem which states that Minimal Disconnected Cut is polynomial time solvable for 3-connected planar graphs but NP-hard for 2-connected planar graphs.
The third chapter looks at Square Root. Whilst a number of results were found, the work in this thesis focuses on the Square Root problem when restricted to some classes of graphs with low clique number.
The final chapter looks at Surjective H-Colouring. This chapter shows that Surjective H-Colouring is NP-complete, for any fixed, non-loop connected graph H with two reflexive vertices and for any fixed graph H’ which can be obtained from H by replacing vertices with true twins. This result enabled us to determine the complexity of Surjective H-Colouring on all fixed graphs H of size at most 4
The Complexity of Approximately Counting Retractions
Let be a graph that contains an induced subgraph . A retraction from
to is a homomorphism from to that is the identity function on
. Retractions are very well-studied: Given , the complexity of deciding
whether there is a retraction from an input graph to is completely
classified, in the sense that it is known for which this problem is
tractable (assuming ). Similarly, the complexity of
(exactly) counting retractions from to is classified (assuming
). However, almost nothing is known about
approximately counting retractions. Our first contribution is to give a
complete trichotomy for approximately counting retractions to graphs of girth
at least . Our second contribution is to locate the retraction counting
problem for each in the complexity landscape of related approximate
counting problems. Interestingly, our results are in contrast to the situation
in the exact counting context. We show that the problem of approximately
counting retractions is separated both from the problem of approximately
counting homomorphisms and from the problem of approximately counting list
homomorphisms --- whereas for exact counting all three of these problems are
interreducible. We also show that the number of retractions is at least as hard
to approximate as both the number of surjective homomorphisms and the number of
compactions. In contrast, exactly counting compactions is the hardest of all of
these exact counting problems
QCSP on reflexive tournaments
We give a complexity dichotomy for the Quantified Constraint Satisfaction Problem QCSP(H) when H is a reflexive tournament. It is well known that reflexive tournaments can be split into a sequence of strongly connected components H1,…,Hn so that there exists an edge from every vertex of Hi to every vertex of Hj if and only if
Graph Relations and Constrained Homomorphism Partial Orders
We consider constrained variants of graph homomorphisms such as embeddings,
monomorphisms, full homomorphisms, surjective homomorpshims, and locally
constrained homomorphisms. We also introduce a new variation on this theme
which derives from relations between graphs and is related to
multihomomorphisms. This gives a generalization of surjective homomorphisms and
naturally leads to notions of R-retractions, R-cores, and R-cocores of graphs.
Both R-cores and R-cocores of graphs are unique up to isomorphism and can be
computed in polynomial time.
The theory of the graph homomorphism order is well developed, and from it we
consider analogous notions defined for orders induced by constrained
homomorphisms. We identify corresponding cores, prove or disprove universality,
characterize gaps and dualities. We give a new and significantly easier proof
of the universality of the homomorphism order by showing that even the class of
oriented cycles is universal. We provide a systematic approach to simplify the
proofs of several earlier results in this area. We explore in greater detail
locally injective homomorphisms on connected graphs, characterize gaps and show
universality. We also prove that for every the homomorphism order on
the class of line graphs of graphs with maximum degree is universal
Mixing graph colourings
This thesis investigates some problems related to graph colouring, or, more precisely, graph re-colouring. Informally, the basic question addressed can be phrased as follows. Suppose one is given a graph G whose vertices can be properly k-coloured, for some k ≥ 2. Is it possible to transform any k-colouring of G into any other by recolouring vertices of G one at a time, making sure a proper k-colouring of G is always maintained? If the answer is in the affirmative, G is said to be k-mixing. The related problem of deciding whether, given two k-colourings of G, it is possible to transform one into the other by recolouring vertices one at a time, always maintaining a proper k-colouring of G, is also considered.
These questions can be considered as having a bearing on certain mathematical and ‘real-world’ problems. In particular, being able to recolour any colouring of a given graph to any other colouring is a necessary pre-requisite for the method of sampling colourings known as Glauber dynamics. The results presented in this thesis may also find application in the context of frequency reassignment: given that the problem of assigning radio frequencies in a wireless communications network is often modelled as a graph colouring problem, the task of re-assigning frequencies in such a network can be thought of as a graph recolouring problem.
Throughout the thesis, the emphasis is on the algorithmic aspects and the computational complexity of the questions described above. In other words, how easily, in terms of computational resources used, can they be answered? Strong results are obtained for the k = 3 case of the first question, where a characterisation theorem for 3-mixing graphs is given. For the second question, a dichotomy theorem for the complexity of the problem is proved: the problem is solvable in polynomial time for k ≤ 3 and PSPACE-complete for k ≥ 4. In addition, the possible length of a shortest sequence of recolourings between two colourings is investigated, and an interesting connection between the tractability of the problem and its underlying structure is established. Some variants of the above problems are also explored
Comparison of progression of diffuse axonal injury with histology and diffusion tensor imaging
Diffuse axonal injury, also known as traumatic axonal injury (TAI), is a major contributor to the pathology of traumatic brain injury. However, TAI is undetectable to conventional clinical magnetic resonance (MR) imaging techniques. Histologically, TAI is characterized by swollen axons that eventually disconnect and form axonal retraction balls (RB) in various white matter tracts. MR-diffusion tensor imaging (MR-DTI) has been reported to be sensitive to TAI in human TBI patients by measuring water molecular diffusion motion in white matter fiber tracts. To date, only one correlative animal study has been carried out to investigate the DTI relationship to TAI, and it has reported a relationship between DTI changes and TAI. No other animal study has validated the correlation between DTI and TAI. Therefore, this study is the second animal study that has examinedthe correlation between histological observations of axonal damage in white mater tract and the DTI measurements over time.
TAI was induced in twenty-four anaesthetized male Sprague Dawley rats utilizing an impact acceleration device (Marmarou et al 1994). T2 weighted MR images, and DTI images were acquired in vivo pre-impact, and four hours, twenty-four hours, three days and seven days post-impact. The DTI images were obtained in a Bruker 4.7 Tesla scanner in six gradient directions. Fractional anisotropy (FA), diffusion trace, axial diffusivity (AD) and radial diffusivity (RD) were calculated by using DTI Studio (Johns Hopkins University). After imaging, perfused brain tissue was processed for &beta-amyloid precursor protein (&beta-APP) and RMO14 immunocytochemistry and quantified by ImageJ software (NIH) for each time point.
&beta-APP and RMO14 immunoreactive axons were observed in optic chiasm (Och) and corpus callosum (CC). TAI was more prevalent and less variable in the Och in comparison to CC. In the Och and CC &beta-APP positive axons were more prominent at eight hours and twenty-eight hours post-TBI and decreased as time elapsed. In the Och and CC RMO14 positive axons were more prominent at twenty-eight hours post-TBI and decreased as time elapsed. However, at seven days post-TBI a modest increase of RMO14 positive axons occurred in comparison to three days post TBI.
The mean FA values of the DTI image of the Och and CC revealed a decrease of FA at four hours post-TBI (p\u3c0.05). After four hours post-TBI the FA value increased and remained increased up to seven days post-TBI in the CC and Och. The other DTI parameters also changed over time.
No linear relationship was found between FA and TAI density and between AD and TAI density in the CC and Och. The diffusion trace was found to be correlated with TAI density at four hours and seven day post-TBI in the Och and CC respectively. The RD was found to be correlated with TAI density at four hours and seven days post-TBI in the Och.
This study was unable to verify that the DTI changes after TBI are an indication of TAI. However, the DTI parameters did change as time elapsed after TBI. The profile of the DTI parameter changes may be an indication of edema. In addition, other imaging parameters, diffusion trace and RD, did show correlation with the density &beta-APP positive axons and may be the better DTI parameters for describing axonal integrity such as axonal permeability
Parameterized Algorithms for Zero Extension and Metric Labelling Problems
We consider the problems Zero Extension and Metric Labelling under the paradigm of parameterized complexity. These are natural, well-studied problems with important applications, but have previously not received much attention from this area.
Depending on the chosen cost function mu, we find that different algorithmic approaches can be applied to design FPT-algorithms: for arbitrary mu we parameterize by the number of edges that cross the cut (not the cost) and show how to solve Zero Extension in time O(|D|^{O(k^2)} n^4 log n) using randomized contractions. We improve this running time with respect to both parameter and input size to O(|D|^{O(k)} m) in the case where mu is a metric. We further show that the problem admits a polynomial sparsifier, that is, a kernel of size O(k^{|D|+1}) that is independent of the metric mu.
With the stronger condition that mu is described by the distances of leaves in a tree, we parameterize by a gap parameter (q - p) between the cost of a true solution q and a `discrete relaxation\u27 p and achieve a running time of O(|D|^{q-p} |T|m + |T|phi(n,m)) where T is the size of the tree over which mu is defined and phi(n,m) is the running time of a max-flow computation. We achieve a similar result for the more general Metric Labelling, while also allowing mu to be the distance metric between an arbitrary subset of nodes in a tree using tools from the theory of VCSPs. We expect the methods used in the latter result to have further applications
- …