Introduction/Background* Assessment of lymph node status is essential in patients with cervical cancer, particularly to determine prognosis and further therapy. The current pathological protocol states that only tissue visible or palpable nodes investigated, the residual fatty stored. We determined a retrospective cohort study value embedding examining all removed tissue, compared prot...

Geographic routing is a routing paradigm, which uses geographic coordinates of network nodes to determine routes. Greedy routing, the simplest form of geographic routing forwards a packet to the closest neighbor towards the destination. A greedy embedding is a embedding of a graph on a geometric space such that greedy routing always guarantees delivery. A Schnyder drawing is a classical way to ...

AbstmctDifferent multiple redundancy schemes for fault detection and correction in computational arrays are proposed and analyzed. The basic idea is to embed a logical array of nodes onto a processor/switch array such that d processors, 1 2 d 5 4, are dedicated to the computation associated with each node. The input to a node is directed to the d processors constituting that node, and the outpu...

An embedding ƒ of a guest graph G, into a host graph H, is a one-to-one mapping from each node i in G to a unique node f (i) in H, andfrom each edge(i,j) in G to a path in H starting at node f (i) and ending at node f '(ƒ). The congestion of f is the maximum number of times any edge of H is used by edges of G. The minimum congestion, over all embeddings, is called the congestion of G into H, an...

We propose a novel approach to visualization of heterogeneous data characterized by both a relationship graph structure and intrinsic features. Each data point is a node in a graph with a given structure. Each data point is also associated with a set of features that have a corresponding distance or similarity measure. A successful visualization accurately captures the desired proximity structu...

Analysis of large networks is a critical component of many of today’s application environments, including online social networks, protein interactions in biological networks, and Internet traffic analysis. The arrival of massive network graphs with hundreds of millions of nodes, e.g. social graphs, presents a unique challenge to graph analysis applications. Most of these applications rely on co...

Shortest paths and shortest path distances are important primary queries for users to query in a large graph. In this paper, we propose a new approach to answer shortest path and shortest path distance queries efficiently with an error bound. The error bound is controlled by a user-specified parameter, and the online query efficiency is achieved with prepossessing offline. In the offline prepro...

Graph analysis is a critical component of applications such as online social networks, protein interactions in biological networks, and Internet traffic analysis. The arrival of massive graphs with hundreds of millions of nodes, e.g. social graphs, presents a unique challenge to graph analysis applications. Most of these applications rely on computing distances between node pairs, which for lar...

In this paper, a deterministic algorithm for dynamically embedding binary trees into hypercubes is presented. Because of a known lower bound, any such algorithm must use either randomization or migration, i.e., remapping of tree vertices, to obtain an embedding of trees into hypercubes with small dilation, load, and expansion simultaneously. Using migration of previously mapped tree vertices, t...

Structure Preserving Embedding (SPE) is a method for embedding graphs in lowdimensional Euclidean space such that the embedding preserves the graph’s global topological properties. Specifically, topology is preserved if a connectivity algorithm can recover the original graph from only the coordinates of its nodes after embedding. Given an input graph and an algorithm for linking embedded nodes,...