129 research outputs found

    Contraction blockers for graphs with forbidden induced paths

    Get PDF
    We consider the following problem: can a certain graph parameter of some given graph be reduced by at least d for some integer d via at most k edge contractions for some given integer k? We examine three graph parameters: the chromatic number, clique number and independence number. For each of these graph parameters we show that, when d is part of the input, this problem is polynomial-time solvable on P4-free graphs and NP-complete as well as W[1]-hard, with parameter d, for split graphs. As split graphs form a subclass of P5-free graphs, both results together give a complete complexity classification for Pℓ-free graphs. The W[1]-hardness result implies that it is unlikely that the problem is fixed-parameter tractable for split graphs with parameter d. But we do show, on the positive side, that the problem is polynomial-time solvable, for each parameter, on split graphs if d is fixed, i.e., not part of the input. We also initiate a study into other subclasses of perfect graphs, namely cobipartite graphs and interval graphs

    Improved Performance of High Areal Density Indirect Drive Implosions at the National Ignition Facility using a Four-Shock Adiabat Shaped Drive

    Get PDF
    Hydrodynamic instabilities can cause capsule defects and other perturbations to grow and degrade implosion performance in ignition experiments at the National Ignition Facility (NIF). Here, we show the first experimental demonstration that a strong unsupported first shock in indirect drive implosions at the NIF reduces ablation front instability growth leading to a 3 to 10 times higher yield with fuel ρR > 1  g/cm[superscript 2]. This work shows the importance of ablation front instability growth during the National Ignition Campaign and may provide a path to improved performance at the high compression necessary for ignition
    corecore