28 research outputs found
Recommended from our members
A Cognitive Radio Compressive Sensing Framework
With the proliferation of wireless devices and services, allied with further significant predicted growth, there is an ever increasing demand for higher transmission rates. This is especially challenging given the limited availability of radio spectrum, and is further exacerbated by a rigid licensing regulatory regime. Spectrum however, is largely underutilized and this has prompted regulators to promote the concept of opportunistic spectrum access. This allows unlicensed secondary users to use bands which are licensed to primary users, but are currently unoccupied, so leading to more efficient spectrum utilization.
A potentially attractive solution to this spectrum underutilisation problem is cognitive radio (CR) technology, which enables the identification and usage of vacant bands by continuously sensing the radio environment, though CR enforces stringent timing requirements and high sampling rates. Compressive sensing (CS) has emerged as a novel sampling paradigm, which provides the theoretical basis to resolve some of these issues, especially for signals exhibiting sparsity in some domain. For CR-related signals however, existing CS architectures such as the random demodulator and compressive multiplexer have limitations in regard to the signal types used, spectrum estimation methods applied, spectral band classification and a dependence on Fourier domain based sparsity.
This thesis presents a new generic CS framework which addresses these issues by specifically embracing three original scientific contributions: i) seamless embedding of the concept of precolouring into existing CS architectures to enhance signal sparsity for CR-related digital modulation schemes; ii) integration of the multitaper spectral estimator to improve sparsity in CR narrowband modulation schemes; and iii) exploiting sparsity in an alternative, non-Fourier (Walsh-Hadamard) domain to expand the applicable CR-related modulation schemes.
Critical analysis reveals the new CS framework provides a consistently superior and robust solution for the recovery of an extensive set of currently employed CR-type signals encountered in wireless communication standards. Significantly, the generic and portable nature of the framework affords the opportunity for further extensions into other CS architectures and sparsity domains
A Brightwell-Winkler type characterisation of NU graphs
In 2000, Brightwell and Winkler characterised dismantlable graphs as the
graphs for which the Hom-graph , defined on the set of
homomorphisms from to , is connected for all graphs . This shows that
the reconfiguration version of the -colouring
problem, in which one must decide for a given whether is
connected, is trivial if and only if is dismantlable.
We prove a similar starting point for the reconfiguration version of the
-extension problem. Where is the subgraph of the
Hom-graph induced by the -colourings extending the
-precolouring of , the reconfiguration version
of the -extension problem asks, for a given -precolouring of a graph
, if is connected. We show that the graphs for which
is connected for every choice of are exactly the
graphs. This gives a new characterisation of graphs, a
nice class of graphs that is important in the algebraic approach to the -dichotomy.
We further give bounds on the diameter of for
graphs , and show that shortest path between two vertices of can be found in parameterised polynomial time. We apply our
results to the problem of shortest path reconfiguration, significantly
extending recent results.Comment: 17 pages, 1 figur
Extending precolourings of circular cliques
Let G be a graph with circular chromatic number Xe(G) = k/q. Given P ⊆ V (G) where the components of G [P] are isomorphic to the circular clique Gk,g suppose the vertices of P have been precoloured with a (k’,g’) - colouring. We examine under what conditions one can be assured the colouring extends to the entire graph. We stud y sufficient conditions based on k’/q’ − k/q as well as the distance between precoloured components of G[P]. In particular, we examine a conjecture of Albertson and West showing the conditions for extendibility are more complex than anticipated in their work
Extension from precoloured sets of edges
We consider precolouring extension problems for proper edge-colourings of graphs and multigraphs, in an attempt to prove stronger versions of Vizing's and Shannon's bounds on the chromatic index of (multi)graphs in terms of their maximum degree Δ. We are especially interested in the following question: when is it possible to extend a precoloured matching to a colouring of all edges of a (multi)graph? This question turns out to be related to the notorious List Colouring Conjecture and other classic notions of choosability
Lower Bounds on the Complexity of MSO1 Model-Checking
One of the most important algorithmic meta-theorems is a famous result by
Courcelle, which states that any graph problem definable in monadic
second-order logic with edge-set quantifications (i.e., MSO2 model-checking) is
decidable in linear time on any class of graphs of bounded tree-width.
Recently, Kreutzer and Tazari proved a corresponding complexity lower-bound -
that MSO2 model-checking is not even in XP wrt. the formula size as parameter
for graph classes that are subgraph-closed and whose tree-width is
poly-logarithmically unbounded. Of course, this is not an unconditional result
but holds modulo a certain complexity-theoretic assumption, namely, the
Exponential Time Hypothesis (ETH).
In this paper we present a closely related result. We show that even MSO1
model-checking with a fixed set of vertex labels, but without edge-set
quantifications, is not in XP wrt. the formula size as parameter for graph
classes which are subgraph-closed and whose tree-width is poly-logarithmically
unbounded unless the non-uniform ETH fails. In comparison to Kreutzer and
Tazari; we use a stronger prerequisite, namely non-uniform instead of
uniform ETH, to avoid the effectiveness assumption and the construction of
certain obstructions used in their proofs; and we assume a different set
of problems to be efficiently decidable, namely MSO1-definable properties on
vertex labeled graphs instead of MSO2-definable properties on unlabeled graphs.
Our result has an interesting consequence in the realm of digraph width
measures: Strengthening the recent result, we show that no subdigraph-monotone
measure can be "algorithmically useful", unless it is within a poly-logarithmic
factor of undirected tree-width
Complexity of colouring problems restricted to unichord-free and \{square,unichord\}-free graphs
A \emph{unichord} in a graph is an edge that is the unique chord of a cycle.
A \emph{square} is an induced cycle on four vertices. A graph is
\emph{unichord-free} if none of its edges is a unichord. We give a slight
restatement of a known structure theorem for unichord-free graphs and use it to
show that, with the only exception of the complete graph , every
square-free, unichord-free graph of maximum degree~3 can be total-coloured with
four colours. Our proof can be turned into a polynomial time algorithm that
actually outputs the colouring. This settles the class of square-free,
unichord-free graphs as a class for which edge-colouring is NP-complete but
total-colouring is polynomial
Graph Partitioning With Input Restrictions
In this thesis we study the computational complexity of a number of graph
partitioning problems under a variety of input restrictions. Predominantly,
we research problems related to Colouring in the case where the input
is limited to hereditary graph classes, graphs of bounded diameter or some
combination of the two.
In Chapter 2 we demonstrate the dramatic eect that restricting our
input to hereditary graph classes can have on the complexity of a decision
problem. To do this, we show extreme jumps in the complexity of three
problems related to graph colouring between the class of all graphs and every
other hereditary graph class.
We then consider the problems Colouring and k-Colouring for Hfree graphs of bounded diameter in Chapter 3. A graph class is said to be
H-free for some graph H if it contains no induced subgraph isomorphic to
H. Similarly, G is said to be H-free for some set of graphs H, if it does not
contain any graph in H as an induced subgraph. Here, the set H consists
usually of a single cycle or tree but may also contain a number of cycles, for
example we give results for graphs of bounded diameter and girth.
Chapter 4 is dedicated to three variants of the Colouring problem,
Acyclic Colouring, Star Colouring, and Injective Colouring.
We give complete or almost complete dichotomies for each of these decision
problems restricted to H-free graphs.
In Chapter 5 we study these problems, along with three further variants of
3-Colouring, Independent Odd Cycle Transversal, Independent
Feedback Vertex Set and Near-Bipartiteness, for H-free graphs of
bounded diameter.
Finally, Chapter 6 deals with a dierent variety of problems. We study
the problems Disjoint Paths and Disjoint Connected Subgraphs for
H-free graphs
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