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 10 of 10 for “"Edge-Vertex"”.

  1. Vertex-Edge and Edge-Vertex Parameters in Graphs

    … focused on either sets of vertices or sets of edges; for example, sets of vertices that dominate all other vertices or sets of edges that dominate all other edges. There has been very little research on ``mixing'' vertices and edges. We investigate several new and several little-studied …

    clemson Repository record for Vertex-Edge and Edge-Vertex Parameters in Graphs (opens in a new tab)

  2. Domain Decomposition Preconditioners for Hermite Collocation Problems

    … boundary conditions. The first method, called <i>edge preconditioning</i>, is based on a decomposition of the domain in parallel strips, and the second, called <i>edge-vertex preconditioning</i>, is based on a two-dimensional decomposition. The preconditioners are derived in terms of two special …

    vt Repository record for Domain Decomposition Preconditioners for Hermite Collocation Problems (opens in a new tab)

  3. Data-driven Storytelling in Dynamic Graph Comics through Hierarchical Clustering

    … a dynamic graph comic given dense, time-series edge-vertex data. Prior research has demonstrated the effectiveness of node-link diagrams as an expressive medium for storytelling with dynamic graphs, and in this work, we develop an interface that generates a customizable comic strip consisting of …

    maryland Repository record for Data-driven Storytelling in Dynamic Graph Comics through Hierarchical Clustering (opens in a new tab)

  4. Capillary Phenomena: Investigations in Compressed Bubble Migration, Geometric Wetting, and Blade-Bound Droplet Stability

    … and industrial processes. So called 'wall-edge-vertex bound drops' (a.k.a. drops on blade tips or drops on leaf tips which they resemble) are explored using a numerical approach which applies the Surface Evolver algorithm through implementation of a new file layer and a multi-parameter …

    portland-state Repository record for Capillary Phenomena: Investigations in Compressed Bubble Migration, Geometric Wetting, and Blade-Bound Droplet Stability (opens in a new tab)

  5. Variations on the power domination problem: Hypergraphs and robustness

    … arc hypergraphs, and trees; and the impact of edge/vertex removal, linear sums, Cartesian products, and weak coronas.</p> <p>The second variation considers how the minimum number of sensors and their placement changes when k sensors are allowed to fail. The PMU-defect robust power domination …

    iastate Repository record for Variations on the power domination problem: Hypergraphs and robustness (opens in a new tab)

  6. Linear-Time Algorithms for Edge-Based Problems

    There is a dearth of algorithms that deal with edge-based problems in trees, specifically algorithms for edge sets that satisfy a particular parameter. The goal of this thesis is to create a methodology for designing algorithms for these edge-based problems. We will present a variant of the Wimer …

    clemson Repository record for Linear-Time Algorithms for Edge-Based Problems (opens in a new tab)

  7. Topology and geometry of chain, ribbon and tube silicates: generation and analysis of infinite one-dimensional arrangements of (TO4)n- tetrahedra

    … as vertices and the linkages between them as edges. Chain arrangements are organized into classes and sub-classes based the number and connectivity of tetrahedra or vertices in the repeat unit (unit cell) of each chain arrangement. Chain graphs that correspond to the most abundant minerals …

    manitoba Repository record for Topology and geometry of chain, ribbon and tube silicates: generation and analysis of infinite one-dimensional arrangements of (TO4)n- tetrahedra (opens in a new tab)

  8. Algorithms and complexity analyses for some combinational optimization problems

    … graph G = (V, E), a non-negative cost for each edge, and a nonnegative connectivity requirement r_{uv} for every (unordered) pair of vertices u, v. The goal is to find a minimum-cost subgraph in which each pair of vertices u,v is joined by at least r_{uv} edge (vertex)-disjoint paths. A …

    njit Repository record for Algorithms and complexity analyses for some combinational optimization problems (opens in a new tab)

  9. Optical and sensing properties of various shaped gold nanoplates and highly controlled asymmetric gold nanoplate/nanosphere coupled assemblies.

    … on the NP. Attachment of multiple NSs at the edge/vertex sites leads to a unique synergistic effect. In contrast to the uniform distribution of NSs, asymmetric distributions of multiple NSs attached to the sides of a NP result in complex, broadened, multi-peaked spectra with larger plasmonic …

    louisville Repository record for Optical and sensing properties of various shaped gold nanoplates and highly controlled asymmetric gold nanoplate/nanosphere coupled assemblies. (opens in a new tab)

  10. A Computational Approach to Identify Covertness and Collusion in Social Networks

    Mathematical and computational interventions in the field of social networks have a fairly recent history. Social networks analysis exists at the intersection of several fields, including social sciences, psychology, organizational behavior, business studies, mathematics, physics, and biology. …

    umn Repository record for A Computational Approach to Identify Covertness and Collusion in Social Networks (opens in a new tab)