Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 3 of 3 for “"graph realization"”.

  1. Robust distribution sensor network localization with noisy range measurements

    … the localization problem as a two-dimensional graph realization problem: given a planar graph with approximately known edge lengths, recover the Euclidean position of each vertex up to a global rotation and translation. This formulation is applicable to the localization of sensor networks in …

    mit Repository record for Robust distribution sensor network localization with noisy range measurements (opens in a new tab)

  2. Characterizations and Probabilistic Representations of Effective Resistance Metrics

    … resistances of finite and infinite weighted graphs. Classical results state that it is a metric on the set of vertices of the graph and that it can be expressed completely in terms of the graph’s random walk. The first goal of this thesis is to provide a concise and accessible starting point …

    qucosa-diss

  3. On vertex degrees, graph decomposition, and circular chromatic Ramsey number

    … vertex degrees and a variant of Ramsey number of graphs, and also structural problems about graph decomposition. In a list (d_1,...,d_n) of positive integers, let r and s denote the largest and smallest entries. A list is gap-free if each integer between r and s is present. In Chapter 2, we prove …

    uiuc Repository record for On vertex degrees, graph decomposition, and circular chromatic Ramsey number (opens in a new tab)