4,794 research outputs found

    An FPT 2-Approximation for Tree-Cut Decomposition

    Full text link
    The tree-cut width of a graph is a graph parameter defined by Wollan [J. Comb. Theory, Ser. B, 110:47-66, 2015] with the help of tree-cut decompositions. In certain cases, tree-cut width appears to be more adequate than treewidth as an invariant that, when bounded, can accelerate the resolution of intractable problems. While designing algorithms for problems with bounded tree-cut width, it is important to have a parametrically tractable way to compute the exact value of this parameter or, at least, some constant approximation of it. In this paper we give a parameterized 2-approximation algorithm for the computation of tree-cut width; for an input nn-vertex graph GG and an integer ww, our algorithm either confirms that the tree-cut width of GG is more than ww or returns a tree-cut decomposition of GG certifying that its tree-cut width is at most 2w2w, in time 2O(w2logw)n22^{O(w^2\log w)} \cdot n^2. Prior to this work, no constructive parameterized algorithms, even approximated ones, existed for computing the tree-cut width of a graph. As a consequence of the Graph Minors series by Robertson and Seymour, only the existence of a decision algorithm was known.Comment: 17 pages, 3 figure

    Planar Disjoint-Paths Completion

    Get PDF
    We introduce Planar Disjoint Paths Completion, a completion counterpart of the Disjoint Paths problem, and study its parameterized complexity. The problem can be stated as follows: given a, not necessarily connected, plane graph G, k pairs of terminals, and a face F of G, find a minimum-size set of edges, if one exists, to be added inside F so that the embedding remains planar and the pairs become connected by k disjoint paths in the augmented network. Our results are twofold: first, we give an upper bound on the number of necessary additional edges when a solution exists. This bound is a function of k, independent of the size of G. Second, we show that the problem is fixed-parameter tractable, in particular, it can be solved in time f(k) · n2

    The Hardness of Embedding Grids and Walls

    Full text link
    The dichotomy conjecture for the parameterized embedding problem states that the problem of deciding whether a given graph GG from some class KK of "pattern graphs" can be embedded into a given graph HH (that is, is isomorphic to a subgraph of HH) is fixed-parameter tractable if KK is a class of graphs of bounded tree width and W[1]W[1]-complete otherwise. Towards this conjecture, we prove that the embedding problem is W[1]W[1]-complete if KK is the class of all grids or the class of all walls

    Bio-energy retains its mitigation potential under elevated CO2

    Get PDF
    Background If biofuels are to be a viable substitute for fossil fuels, it is essential that they retain their potential to mitigate climate change under future atmospheric conditions. Elevated atmospheric CO2 concentration [CO2] stimulates plant biomass production; however, the beneficial effects of increased production may be offset by higher energy costs in crop management. Methodology/Main findings We maintained full size poplar short rotation coppice (SRC) systems under both current ambient and future elevated [CO2] (550 ppm) and estimated their net energy and greenhouse gas balance. We show that a poplar SRC system is energy efficient and produces more energy than required for coppice management. Even more, elevated [CO2] will increase the net energy production and greenhouse gas balance of a SRC system with 18%. Managing the trees in shorter rotation cycles (i.e. 2 year cycles instead of 3 year cycles) will further enhance the benefits from elevated [CO2] on both the net energy and greenhouse gas balance. Conclusions/significance Adapting coppice management to the future atmospheric [CO2] is necessary to fully benefit from the climate mitigation potential of bio-energy systems. Further, a future increase in potential biomass production due to elevated [CO2] outweighs the increased production costs resulting in a northward extension of the area where SRC is greenhouse gas neutral. Currently, the main part of the European terrestrial carbon sink is found in forest biomass and attributed to harvesting less than the annual growth in wood. Because SRC is intensively managed, with a higher turnover in wood production than conventional forest, northward expansion of SRC is likely to erode the European terrestrial carbon sink

    "Resurrection of clinical efficacy" after resistance to endocrine therapy in metastatic breast cancer

    Get PDF
    BACKGROUND: In a significant proportion of metastatic breast cancer (MBC) patients whose tumour has progressed within 6 months of endocrine therapy (de novo resistance), it is generally believed that the chance of achieving clinical benefit (CB) with further endocrine therapy is minimal. METHODS: Data was retrieved from a prospectively updated database of metastatic breast cancer. Relevant data was exported to SPSS™ software for statistical analysis. RESULTS: In oestrogen receptor (ER) positive MBC patients with assessable disease, CB was achieved in 159 (71.3%) (1(st )line) patients. When these patients were put on further endocrine therapy, the CB rates were 63.2% (on 2(nd )line), 46.1% (on 3(rd )line) and 20% (on 4(th )line) with a median duration of response (DOR) in those with CB of 22, 12, 11 and 15 months respectively. The remaining 64(28.7%) patients had de novo resistance on 1(st )line endocrine therapy. Seventeen of these patients were treated with further endocrine therapy. The CB rates were 29.4% (on 2(nd )line) and 22.2% (on 3(rd )line) with a median DOR in those with CB of 22.7 months and 14 months respectively. CONCLUSION: The chance of further endocrine response continues to decrease with each line of therapy, yet CB is still seen with reasonable duration even with a 4(th )line agent. In addition, further endocrine response, with long duration, can be seen in a significant proportion of patients who have developed de novo resistance to 1(st )line endocrine therapy. The use of further endocrine therapy should not be excluded under these circumstances

    Cardiovascular changes after administration of aerosolized salbutamol in horses: five cases

    Get PDF
    Prevention and treatment of intraoperative hypoxemia in horses is difficult and both efficacy and safety of therapeutic maneuvers have to be taken into account. Inhaled salbutamol has been suggested as treatment of hypoxia in horses during general anesthesia, due to safety and ease of the technique. The present report describes the occurrence of clinically relevant unwanted cardiovascular effects (i.e. tachycardia and blood pressure modifications) in 5 horses undergoing general anesthesia in dorsal recumbency after salbutamol inhalation. Balanced anesthesia based on inhalation of isoflurane in oxygen or oxygen and air and continuous rate infusion (CRI) of lidocaine, romifidine, or combination of lidocaine and guaifenesine and ketamine was provided. Supportive measures were necessary to restore normal cardiovascular function in all horses but no long-term adverse effects were noticed in any of the cases

    Steiner trees for hereditary graph classes.

    Get PDF
    We consider the classical problems (Edge) Steiner Tree and Vertex Steiner Tree after restricting the input to some class of graphs characterized by a small set of forbidden induced subgraphs. We show a dichotomy for the former problem restricted to (H1,H2) -free graphs and a dichotomy for the latter problem restricted to H-free graphs. We find that there exists an infinite family of graphs H such that Vertex Steiner Tree is polynomial-time solvable for H-free graphs, whereas there exist only two graphs H for which this holds for Edge Steiner Tree. We also find that Edge Steiner Tree is polynomial-time solvable for (H1,H2) -free graphs if and only if the treewidth of the class of (H1,H2) -free graphs is bounded (subject to P≠NP ). To obtain the latter result, we determine all pairs (H1,H2) for which the class of (H1,H2) -free graphs has bounded treewidth

    Friedreich ataxia patient tissues exhibit increased 5-hydroxymethylcytosine modification and decreased CTCF binding at the FXN locus

    Get PDF
    © 2013 Al-Mahdawi et al. This is an open-access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use,distribution, and reproduction in any medium, provided the original author and source are credited.This article has been made available through the Brunel Open Access Publishing Fund.Friedreich ataxia (FRDA) is caused by a homozygous GAA repeat expansion mutation within intron 1 of the FXN gene, which induces epigenetic changes and FXN gene silencing. Bisulfite sequencing studies have identified 5-methylcytosine (5 mC) DNA methylation as one of the epigenetic changes that may be involved in this process. However, analysis of samples by bisulfite sequencing is a time-consuming procedure. In addition, it has recently been shown that 5-hydroxymethylcytosine (5 hmC) is also present in mammalian DNA, and bisulfite sequencing cannot distinguish between 5 hmC and 5 mC.The research leading to these results has received funding from the European Union Seventh Framework Programme (FP7/2007-2013) under grant agreement number 242193/EFACTS (CS), the Wellcome Trust [089757] (SA) and Ataxia UK (RMP) to MAP
    corecore