An important step in laying out hierarchical network diagrams is to order the nodes on each level. The usual approach is to minimize the number of edge crossings. This problem is NP-hard even for two layers when the first layer is fixed. Hence, in practice crossing minimization is performed using heuristics. Another suggested approach is to maximize the planar subgraph, i.e. find the least numb...

In this paper we study the problem of recognizing and representing dynamically changing proper interval graphs. The input to the problem consists of a series of modifications to be performed on a graph, where a modification can be a deletion or an addition of a vertex or an edge. The objective is to maintain a representation of the graph as long as it remains a proper interval graph, and to det...

duchenne muscular dystrophy (dmd) and the milder allelic becker muscular dystrophy (bmd) are x-linked disorders. both dmd & bmd result from heterogenous mutation in the dystrophin gene and in about 65% of the cases one or more exons of the gene are deleted or duplicated. one third of cases arise from new mutation and the rest are familial. to analyze the prevalence of deletion in iranian patien...

in financial distress studies selection of variable is commonly basedon the success of variables in variable sets employed in earlierbankruptcy studies, suggestions in the literature or an accompanyingdata reduction in a large set of variables. if seemingly different variablesets exhibit a strong relationship then heterogeneous variable setscapture common information. canonical correlation anal...

We present a new approach to the deletion method that is based on the Harris inequality. We obtain deletion lemmas that are similar in spirit to those of Rödl and Ruciński, but hold for arbitrary decreasing properties. That is, we show that under appropriate conditions, with very high (‘Janson-like’) probability it suffices to delete a small fraction of the edges of a random graph Gn,p to ensur...

Abstract Anomaly detection plays a crucial role in many Internet of Things (IoT) applications such as traffic anomaly for smart transportation and medical diagnosis healthcare. With the explosion IoT data, on data streams raises higher requirements real-time response strong robustness large-scale arriving at same time various application fields. However, existing methods are either slow or appl...

We introduce the NP-hard graph-based data clustering problem s-Plex Cluster Vertex Deletion, where the task is to delete at most k vertices from a graph so that the connected components of the resulting graph are s-plexes. In an s-plex, every vertex has an edge to all but at most s − 1 other vertices; cliques are 1-plexes. We propose a new method for kernelizing a large class of vertex deletion...

Given a rooted tree with n nodes, the tree shortcut problem is to add a set of shortcut edges to the tree such that the shortest path from each node to any of its ancestors is of length O(logn) and the degree increment of each node is constant. We consider in this paper the dynamic version of the problem, which supports node insertion and deletion. For insertion, a node can be inserted as a lea...

In this paper, we consider the topological interference management (TIM) problem in a dynamic setting, where an adversary perturbs network topology to prevent exploitation of sophisticated coding opportunities (e.g., alignment). Focusing on special class – chordal networks investigate algorithmic aspects TIM under adversarial perturbation. particular, given perturbation with respect edge insert...

Given a fixed graph H, the H-free editing problem asks whether we can edit at most k edges to make contain no induced copy of H. We obtain polynomial kernel for this when H is diamond. The incompressibility dichotomy being 3-connected and classical complexity suggest that except complete/empty graph, problems admit kernels only few small graphs Therefore, believe our result an essential step to...