b a ckground: the management of internal mammary (im) nodes in breast cancer lacks a well-defined consensus. lymphoscintigraphy identifies up to one-third of breast cancer patients with extra-axillary drainage, which is mainly located in the im chain. our aim in this meta-analysis is to identify the lymphoscintigraphy technique variables that effect im node identification. m ethods: an internet...

We introduce an energy model whose minimum energy drawings reveal the clusters of the drawn graph. Here a cluster is a set of nodes with many internal edges and few edges to nodes outside the set. The drawings of the bestknown force and energy models do not clearly show clusters for graphs whose diameter is small relative to the number of nodes. We formally characterize the minimum energy drawi...

Given a weighted undirected graph G=(V,E) with positive costs on the edges and a positive constant d, the min-degree constrained minimum spanning tree problem is to find a minimum cost spanning tree T of G where each node I of T either has degree at least d or is a leaf node. Thus, the goal is to find a spanning tree T where all its non-leaf nodes (or central nodes) have degree at least d. Thes...

We study the problem of the amount of information required to draw a complete or a partial map of a graph with unlabeled nodes and arbitrarily labeled ports. A mobile agent, starting at any node of an unknown connected graph and walking in it, has to accomplish one of the following tasks: draw a complete map of the graph, i.e., find an isomorphic copy of it including port numbering, or draw a p...

For given a pair of nodes in a graph, the minimum non-separating path problem looks for a minimum weight path between the two nodes such that the remaining graph after removing the path is still connected. The balanced connected bipartition (BCP2) problem looks for a way to bipartition a graph into two connected subgraphs with their weights as equal as possible. In this paper we present an algo...

We study the hardness of approximation for the MINIMUM HACKING problem, which roughly can be described as the problem of finding the best way to compromise some target nodes given a few initial compromised nodes in a network. We give three reductions to show that MINIMUM HACKING is not approximable to within where , for any ! " $#% . In particular, the reductions are from a PCP, from the MINIMU...

We introduce an energy model whose minimum energy drawings reveal the clusters of the drawn graph. Here a cluster is a set of nodes with many internal edges edges and few edges to outside nodes. The drawings of previous force and energy models do not clearly show clusters for graphs with small diameter. We formally characterize the minimum energy drawings of our energy model. This characterizat...

A sensor network is one of the most adaptive research area that requires the optimization in term of energy effectiveness, load balancing etc. The sensor network is defined under the particular localization architecture and having the challenges in terms of load minimization, energy loss reduction, security etc. One of such common and most adaptive research problem is routing. In this paper, op...

Energy efficiency is an important problem in wireless sensor networks. In this paper, we consider the energy efficiency problem in a heterogeneous wireless sensor network which consists of energy-constrained sensor nodes and resource-rich relay nodes. We firstly formulate the minimum relayconnected sensor cover (MRCSC) problem for heterogeneous sensor networks. The purpose of this problem is to...