31 research outputs found

    Parameterized lower bound and NP-completeness of some HH-free Edge Deletion problems

    Get PDF
    For a graph HH, the HH-free Edge Deletion problem asks whether there exist at most kk edges whose deletion from the input graph GG results in a graph without any induced copy of HH. We prove that HH-free Edge Deletion is NP-complete if HH is a graph with at least two edges and HH has a component with maximum number of vertices which is a tree or a regular graph. Furthermore, we obtain that these NP-complete problems cannot be solved in parameterized subexponential time, i.e., in time 2o(k)⋅∣G∣O(1)2^{o(k)}\cdot |G|^{O(1)}, unless Exponential Time Hypothesis fails.Comment: 15 pages, COCOA 15 accepted pape

    Deleting edges to restrict the size of an epidemic: a new application for treewidth

    Get PDF
    Motivated by applications in network epidemiology, we consider the problem of determining whether it is possible to delete at most k edges from a given input graph (of small treewidth) so that the resulting graph avoids a set FF of forbidden subgraphs; of particular interest is the problem of determining whether it is possible to delete at most k edges so that the resulting graph has no connected component of more than h vertices, as this bounds the worst-case size of an epidemic. While even this special case of the problem is NP-complete in general (even when h=3h=3 ), we provide evidence that many of the real-world networks of interest are likely to have small treewidth, and we describe an algorithm which solves the general problem in time 2O(|F|wr)n2O(|F|wr)n  on an input graph having n vertices and whose treewidth is bounded by a fixed constant w, if each of the subgraphs we wish to avoid has at most r vertices. For the special case in which we wish only to ensure that no component has more than h vertices, we improve on this to give an algorithm running in time O((wh)2wn)O((wh)2wn) , which we have implemented and tested on real datasets based on cattle movements

    Acromegaly caused by growth hormone-releasing hormone-producing tumors: long-term observational studies in three patients

    Get PDF
    We report on three newly diagnosed patients with extracranial ectopic GHRH-associated acromegaly with long-term follow-up after surgery of the primary tumor. One patient with a pancreatic tumor and two parathyroid adenomas was the index case of a large kindred of MEN-I syndrome. The other two patients had a large bronchial carcinoid. The first patient is still in remission now almost 22 years after surgery. In the two other patients GHRH did not normalize completely after surgery and they are now treated with slow-release octreotide. IGF-I normalized in all patients. During medical treatment basal GH secretion remained (slightly) elevated and secretory regularity was decreased in 24 h blood sampling studies. We did not observe development of tachyphylaxis towards the drug or radiological evidence of (growing) metastases. We propose life-long suppressive therapy with somatostatin analogs in cases with persisting elevated serum GHRH concentrations after removal of the primary tumor. Independent parameters of residual disease are elevated basal (nonpulsatile) GH secretion and decreased GH secretory regularity

    Clinical, quality of life, and economic value of acromegaly disease control

    Get PDF
    Although acromegaly is a rare disease, the clinical, economic and health-related quality of life (HRQoL) burden is considerable due to the broad spectrum of comorbidities as well as the need for lifelong management. We performed a comprehensive literature review of the past 12 years (1998–2010) to determine the benefit of disease control (defined as a growth hormone [GH] concentration <2.5 Όg/l and insulin-like growth factor [IGF]-1 normal for age) on clinical, HRQoL, and economic outcomes. Increased GH and IGF-1 levels and low frequency of somatostatin analogue use directly predicted increased mortality risk. Clinical outcome measures that may improve with disease control include joint articular cartilage thickness, vertebral fractures, left ventricular function, exercise capacity and endurance, lipid profile, and obstructive apnea events. Some evidence suggests an association between controlled disease and improved HRQoL. Total direct treatment costs were higher for patients with uncontrolled compared to controlled disease. Costs incurred for management of comorbidities, and indirect cost could further add to treatment costs. Optimizing disease control in patients with acromegaly appears to improve outcomes. Future studies need to evaluate clinical outcomes, as well as HRQoL and comprehensive economic outcomes achieved with controlled disease

    ICAR: endoscopic skull‐base surgery

    Get PDF
    n/

    Subgraph isomorphism on graph classes that exclude a substructure

    Get PDF
    \u3cp\u3eWe study Subgraph Isomorphism on graph classes defined by a fixed forbidden graph. Although there are several ways for forbidding a graph, we observe that it is reasonable to focus on the minor relation since other well-known relations lead to either trivial or equivalent problems. When the forbidden minor is connected, we present a near dichotomy of the complexity of Subgraph Isomorphism with respect to the forbidden minor, where the only unsettled case is the path of five vertices. We then also consider the general case of possibly disconnected forbidden minors. We show in particular that: the problem is fixed-parameter tractable parameterized by the size of the forbidden minor H when H is a linear forest such that at most one component has four vertices and all other components have three or less vertices; and it is NP-complete if H contains four or more components with at least five vertices each. As a byproduct, we show that Subgraph Isomorphism is fixed-parameter tractable parameterized by vertex integrity. Using similar techniques, we also observe that Subgraph Isomorphism is fixed-parameter tractable parameterized by neighborhood diversity.\u3c/p\u3
    corecore