139 research outputs found

    Exploring the Complexity of Layout Parameters in Tournaments and Semi-Complete Digraphs

    Get PDF
    A simple digraph is semi-complete if for any two of its vertices u and v, at least one of the arcs (u,v) and (v,u) is present. We study the complexity of computing two layout parameters of semi-complete digraphs: cutwidth and optimal linear arrangement (OLA). We prove that: -Both parameters are NP-hard to compute and the known exact and parameterized algorithms for them have essentially optimal running times, assuming the Exponential Time Hypothesis. - The cutwidth parameter admits a quadratic Turing kernel, whereas it does not admit any polynomial kernel unless coNP/poly contains NP. By contrast, OLA admits a linear kernel. These results essentially complete the complexity analysis of computing cutwidth and OLA on semi-complete digraphs. Our techniques can be also used to analyze the sizes of minimal obstructions for having small cutwidth under the induced subdigraph relation

    On the Distance Identifying Set Meta-Problem and Applications to the Complexity of Identifying Problems on Graphs

    Get PDF
    Numerous problems consisting in identifying vertices in graphs using distances are useful in domains such as network verification and graph isomorphism. Unifying them into a meta-problem may be of main interest. We introduce here a promising solution named Distance Identifying Set. The model contains Identifying Code (IC), Locating Dominating Set (LD) and their generalizations rr-IC and rr-LD where the closed neighborhood is considered up to distance rr. It also contains Metric Dimension (MD) and its refinement rr-MD in which the distance between two vertices is considered as infinite if the real distance exceeds rr. Note that while IC = 1-IC and LD = 1-LD, we have MD = ∞\infty-MD; we say that MD is not local In this article, we prove computational lower bounds for several problems included in Distance Identifying Set by providing generic reductions from (Planar) Hitting Set to the meta-problem. We mainly focus on two families of problem from the meta-problem: the first one, called bipartite gifted local, contains rr-IC, rr-LD and rr-MD for each positive integer rr while the second one, called 1-layered, contains LD, MD and rr-MD for each positive integer rr. We have: - the 1-layered problems are NP-hard even in bipartite apex graphs, - the bipartite gifted local problems are NP-hard even in bipartite planar graphs, - assuming ETH, all these problems cannot be solved in 2o(n)2^{o(\sqrt{n})} when restricted to bipartite planar or apex graph, respectively, and they cannot be solved in 2o(n)2^{o(n)} on bipartite graphs, - even restricted to bipartite graphs, they do not admit parameterized algorithms in 2O(k).nO(1)2^{O(k)}.n^{O(1)} except if W[0] = W[2]. Here kk is the solution size of a relevant identifying set. In particular, Metric Dimension cannot be solved in 2o(n)2^{o(n)} under ETH, answering a question of Hartung in 2013

    Linear-vertex kernel for the problem of packing r-stars into a graph without long induced paths

    Get PDF
    Let integers r≄2r\ge 2 and d≄3d\ge 3 be fixed. Let Gd{\cal G}_d be the set of graphs with no induced path on dd vertices. We study the problem of packing kk vertex-disjoint copies of K1,rK_{1,r} (k≄2k\ge 2) into a graph GG from parameterized preprocessing, i.e., kernelization, point of view. We show that every graph G∈GdG\in {\cal G}_d can be reduced, in polynomial time, to a graph Gâ€Č∈GdG'\in {\cal G}_d with O(k)O(k) vertices such that GG has at least kk vertex-disjoint copies of K1,rK_{1,r} if and only if Gâ€ČG' has. Such a result is known for arbitrary graphs GG when r=2r=2 and we conjecture that it holds for every r≄2r\ge 2

    Measurements of fiducial and differential cross sections for Higgs boson production in the diphoton decay channel at s√=8 TeV with ATLAS

    Get PDF
    Measurements of fiducial and differential cross sections are presented for Higgs boson production in proton-proton collisions at a centre-of-mass energy of s√=8 TeV. The analysis is performed in the H → γγ decay channel using 20.3 fb−1 of data recorded by the ATLAS experiment at the CERN Large Hadron Collider. The signal is extracted using a fit to the diphoton invariant mass spectrum assuming that the width of the resonance is much smaller than the experimental resolution. The signal yields are corrected for the effects of detector inefficiency and resolution. The pp → H → γγ fiducial cross section is measured to be 43.2 ±9.4(stat.) − 2.9 + 3.2 (syst.) ±1.2(lumi)fb for a Higgs boson of mass 125.4GeV decaying to two isolated photons that have transverse momentum greater than 35% and 25% of the diphoton invariant mass and each with absolute pseudorapidity less than 2.37. Four additional fiducial cross sections and two cross-section limits are presented in phase space regions that test the theoretical modelling of different Higgs boson production mechanisms, or are sensitive to physics beyond the Standard Model. Differential cross sections are also presented, as a function of variables related to the diphoton kinematics and the jet activity produced in the Higgs boson events. The observed spectra are statistically limited but broadly in line with the theoretical expectations

    Evidence for the Higgs-boson Yukawa coupling to tau leptons with the ATLAS detector

    Get PDF
    Results of a search for H → τ τ decays are presented, based on the full set of proton-proton collision data recorded by the ATLAS experiment at the LHC during 2011 and 2012. The data correspond to integrated luminosities of 4.5 fb−1 and 20.3 fb−1 at centre-of-mass energies of √s = 7 TeV and √s = 8 TeV respectively. All combinations of leptonic (τ → `ÎœÎœÂŻ with ` = e, ”) and hadronic (τ → hadrons Îœ) tau decays are considered. An excess of events over the expected background from other Standard Model processes is found with an observed (expected) significance of 4.5 (3.4) standard deviations. This excess provides evidence for the direct coupling of the recently discovered Higgs boson to fermions. The measured signal strength, normalised to the Standard Model expectation, of ” = 1.43 +0.43 −0.37 is consistent with the predicted Yukawa coupling strength in the Standard Model

    Study of ordered hadron chains with the ATLAS detector

    Get PDF
    La lista completa de autores que integran el documento puede consultarse en el archivo

    Fiducial and differential cross sections of Higgs boson production measured in the four-lepton decay channel in pp collisions at √s = 8 TeV with the ATLAS detector

    Get PDF
    Measurements of fiducial and differential cross sections of Higgs boson production in the H→ZZ∗ → 4ℓ decay channel are presented. The cross sections are determined within a fiducial phase space and corrected for detection efficiency and resolution effects. They are based on 20.3 fb−Âč of pp collision data, produced at √s = 8 TeV centre-of-mass energy at the LHC and recorded by the ATLAS detector. The differential measurements are performed in bins of transverse momentum and rapidity of the four-lepton system, the invariant mass of the subleading lepton pair and the decay angle of the leading lepton pair with respect to the beam line in the four-lepton rest frame, as well as the number of jets and the transverse momentum of the leading jet. The measured cross sections are compared to selected theoretical calculations of the Standard Model expectations. No significant deviation from any of the tested predictions is found
    • 

    corecore