147 research outputs found
Letter graphs and geometric grid classes of permutations: characterization and recognition
In this paper, we reveal an intriguing relationship between two seemingly
unrelated notions: letter graphs and geometric grid classes of permutations. An
important property common for both of them is well-quasi-orderability,
implying, in a non-constructive way, a polynomial-time recognition of geometric
grid classes of permutations and -letter graphs for a fixed . However,
constructive algorithms are available only for . In this paper, we present
the first constructive polynomial-time algorithm for the recognition of
-letter graphs. It is based on a structural characterization of graphs in
this class.Comment: arXiv admin note: text overlap with arXiv:1108.6319 by other author
Fast Arc-Annotated Subsequence Matching in Linear Space
An arc-annotated string is a string of characters, called bases, augmented
with a set of pairs, called arcs, each connecting two bases. Given
arc-annotated strings and the arc-preserving subsequence problem is to
determine if can be obtained from by deleting bases from . Whenever
a base is deleted any arc with an endpoint in that base is also deleted.
Arc-annotated strings where the arcs are ``nested'' are a natural model of RNA
molecules that captures both the primary and secondary structure of these. The
arc-preserving subsequence problem for nested arc-annotated strings is basic
primitive for investigating the function of RNA molecules. Gramm et al. [ACM
Trans. Algorithms 2006] gave an algorithm for this problem using time
and space, where and are the lengths of and , respectively. In
this paper we present a new algorithm using time and space,
thereby matching the previous time bound while significantly reducing the space
from a quadratic term to linear. This is essential to process large RNA
molecules where the space is likely to be a bottleneck. To obtain our result we
introduce several novel ideas which may be of independent interest for related
problems on arc-annotated strings.Comment: To appear in Algoritmic
On retracts, absolute retracts, and folds in cographs
Let G and H be two cographs. We show that the problem to determine whether H
is a retract of G is NP-complete. We show that this problem is fixed-parameter
tractable when parameterized by the size of H. When restricted to the class of
threshold graphs or to the class of trivially perfect graphs, the problem
becomes tractable in polynomial time. The problem is also soluble when one
cograph is given as an induced subgraph of the other. We characterize absolute
retracts of cographs.Comment: 15 page
Fast branching algorithm for Cluster Vertex Deletion
In the family of clustering problems, we are given a set of objects (vertices
of the graph), together with some observed pairwise similarities (edges). The
goal is to identify clusters of similar objects by slightly modifying the graph
to obtain a cluster graph (disjoint union of cliques). Hueffner et al. [Theory
Comput. Syst. 2010] initiated the parameterized study of Cluster Vertex
Deletion, where the allowed modification is vertex deletion, and presented an
elegant O(2^k * k^9 + n * m)-time fixed-parameter algorithm, parameterized by
the solution size. In our work, we pick up this line of research and present an
O(1.9102^k * (n + m))-time branching algorithm
AO-4025 ITT ESA - Surface treatments and coatings for reduction of multipactor and Passive InterModulation (PIM) effect in RF components
This is the electronic version of a paper presented at the 4th International Workshop on Multipactor, Corona and Passive Intermodulation in Space RF Hardware (MULCOPIM 2003) held in Noordwijk, The Netherlands.ESA has initiated several activities with the aim to reduce the risk of multipaction and corona effects in space hardware. Within the activity Surface Treatment and Coating for the Reduction of Multipactor and Passive Intermodulation (PIM) Effects in RF Components a European group has been formed to investigate new surface coatings / treatments to improve the power handling capability of passive equipment with respect to
multipactor and passive intermodulation. This paper presents an overview of the activities to be performed within this project and describes the first results
Parameterized Complexity of 1-Planarity
We consider the problem of finding a 1-planar drawing for a general graph,
where a 1-planar drawing is a drawing in which each edge participates in at
most one crossing. Since this problem is known to be NP-hard we investigate the
parameterized complexity of the problem with respect to the vertex cover
number, tree-depth, and cyclomatic number. For these parameters we construct
fixed-parameter tractable algorithms. However, the problem remains NP-complete
for graphs of bounded bandwidth, pathwidth, or treewidth.Comment: WADS 201
Well-quasi-ordering versus clique-width : new results on bigenic classes.
Daligault, Rao and Thomassé conjectured that if a hereditary class of graphs is well-quasi-ordered by the induced subgraph relation then it has bounded clique-width. Lozin, Razgon and Zamaraev recently showed that this conjecture is not true for infinitely defined classes. For finitely defined classes the conjecture is still open. It is known to hold for classes of graphs defined by a single forbidden induced subgraph H, as such graphs are well-quasi-ordered and are of bounded clique-width if and only if H is an induced subgraph of P4P4. For bigenic classes of graphs i.e. ones defined by two forbidden induced subgraphs there are several open cases in both classifications. We reduce the number of open cases for well-quasi-orderability of such classes from 12 to 9. Our results agree with the conjecture and imply that there are only two remaining cases to verify for bigenic classes
A Counterexample Regarding Labelled Well-Quasi-Ordering
Korpelainen, Lozin, and Razgon conjectured that a hereditary property of graphs which is well-quasi-ordered by the induced subgraph order and defined by only finitely many minimal forbidden induced subgraphs is labelled well-quasi-ordered, a notion stronger than that of n-well-quasi-order introduced by Pouzet in the 1970s. We present a counterexample to this conjecture. In fact, we exhibit a hereditary property of graphs which is well-quasi-ordered by the induced subgraph order and defined by finitely many minimal forbidden induced subgraphs yet is not 2-well-quasi-ordered. This counterexample is based on the widdershins spiral, which has received some study in the area of permutation patterns
Longest Increasing Subsequence under Persistent Comparison Errors
We study the problem of computing a longest increasing subsequence in a
sequence of distinct elements in the presence of persistent comparison
errors. In this model, every comparison between two elements can return the
wrong result with some fixed (small) probability , and comparisons cannot
be repeated. Computing the longest increasing subsequence exactly is impossible
in this model, therefore, the objective is to identify a subsequence that (i)
is indeed increasing and (ii) has a length that approximates the length of the
longest increasing subsequence.
We present asymptotically tight upper and lower bounds on both the
approximation factor and the running time. In particular, we present an
algorithm that computes an -approximation in time , with
high probability. This approximation relies on the fact that that we can
approximately sort elements in time such that the maximum
dislocation of an element is at most . For the lower bounds, we
prove that (i) there is a set of sequences, such that on a sequence picked
randomly from this set every algorithm must return an -approximation with high probability, and (ii) any -approximation
algorithm for longest increasing subsequence requires
comparisons, even in the absence of errors
UK Geoenergy Observatories Glasgow: GGC01 cored, seismic monitoring borehole – final data release
This report provides an overview of information contained in the final data release for the UK Geoenergy Observatories Glasgow borehole GGC01. This final data release supersedes the initial and intermediate data releases (Starcher et al. 2019; Kearsey et al. 2019). It includes additional information on core scan data and core-wireline depth integration.
The cored, seismic monitoring borehole GGC01 (BGS SOBI number NS66SW BJ 3754, BGS ID 20650619) was drilled between 19 November and 12 December 2018 producing a core of 102 mm diameter. The borehole was wireline logged in December 2018 and a string of 5 seismometers were installed in February 2019.
The core was transported to the National Geological Repository (NGR) at BGS Keyworth and was curated into 1 m core boxes. State-of-the-art core scanners have been used to collect along core datasets. This final data release includes optical images (whole core and slabbed core), radiographic images, MSCL-S (geophysical), NIR and XRF (mineralogical and chemical) core scan data.
Also included in this final release is the material from the previous releases including sedimentary, discontinuity and engineering logs, wireline/geophysical downhole logs, drillers’ logs and sample information
- …