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 20 of 25 for “"edge sets"”.

  1. Properties of Random Connected Edge Sets in Hypercubic Lattices

    … a probability space Ω(l) consisting of connected edge sets in a d-dimensional hypercubic lattice, inspired by the two-point correlation function of the Ising model. We introduce a*ᵈ, the supremum of a such that μₐ is a well-defined probability measure. We show that a*ᵈ is independent of l. By …

    chalmers Repository record for Properties of Random Connected Edge Sets in Hypercubic Lattices (opens in a new tab)

  2. Extremal Problems for Partitions of Edge Sets of Graphs

    … problems in graph theory about partitions of the edge sets of graphs (also known as graph decompositions). The first family we address consists of induced Ramsey number problems. Induced Ramsey numbers generalize ordinary Ramsey numbers. The induced Ramsey number of a pair of graphs G and H is the …

    uiuc Repository record for Extremal Problems for Partitions of Edge Sets of Graphs (opens in a new tab)

  3. Ideal Graphs

    … set being the set of proper ideals; various edge sets defined via different ideal theoretic conditions give visual insights and structure theorems pertaining to the multiplicative ideal theory of R. We characterize the interplay between the ideal theory and various properties of these graphs …

    ndsu Repository record for Ideal Graphs (opens in a new tab)

  4. Abelian Sandpile Models on Edge Periodic Graphs

    … some of the dynamics of this system when the edges of the graph are allowed to alternate between two different edge sets. This system will be framed in a similar fashion as the classical model, and then some basic numerical simulations were used to observe the threshold behavior of the system. …

    boise Repository record for Abelian Sandpile Models on Edge Periodic Graphs (opens in a new tab)

  5. Intersection graphs, fraternally orientable graphs and hamiltonian cycles.

    … G(V, E), where V and E denote the vertex and edge sets of G(V, E), respectively. An orientation $\vec G$ of G(V, E) is the result of giving an orientation to the edges of G. A directed graph is fraternally oriented if for every three vertices u, v, w, the existence of the edges $u\to w$ and …

    ottawa-retro Repository record for Intersection graphs, fraternally orientable graphs and hamiltonian cycles. (opens in a new tab)

  6. Finding the Densest Common Subgraph with Linear Programming

    … subgraphs, speci cally for graphs with multiple edge sets. Our work improves the running time of an existing Linear Program (LP) for solving the Densest Common Subgraph problem. This LP was originally created by Moses Charikar for a single graph and extended to multiple graphs (DCS LP) by Vinay …

    chalmers Repository record for Finding the Densest Common Subgraph with Linear Programming (opens in a new tab)

  7. Estimating the number of covering relations in a formal concept lattice

    … graph called a formal concept lattice. For large sets of data, drawing the graph is not reasonable. We focus on quantitative characteristics of the lattice structure that lead to decreased computation time in the determination of nodes and edge sets on large lattices from big data.</p> <p>This …

    iastate Repository record for Estimating the number of covering relations in a formal concept lattice (opens in a new tab)

  8. On Domination and Bondage Numbers of Some Classes of Graphs

    … is the minimum cardinality among all dominating sets of G. In a network, the domination number determines the minimum number of sites required to dominate the entire network at a minimum cost. The bondage number of a graph G is the minimum cardinality among all edge sets B such that ?(G-B) > …

    mississippi Repository record for On Domination and Bondage Numbers of Some Classes of Graphs (opens in a new tab)

  9. MacLane's Theorem for Graph-Like Spaces

    … space of a finite graph is the subspace of the edge space generated by the edge sets of cycles, and is a well-studied object in graph theory. Recently progress has been made towards extending the theory of cycle spaces to infinite graphs. Graph-like spaces are a class of topological objects that …

    waterloo Repository record for MacLane's Theorem for Graph-Like Spaces (opens in a new tab)

  10. The edit distance function: Forbidding induced powers of cycles and other questions

    … be the size of the symmetric difference of the edge sets. The edit distance between a graph, $G$, and a graph property, $\mathcal{H}$, is the minimum edit distance between $G$ and a graph in $\mathcal{H}$. The edit distance function of a graph property $\mathcal{H}$ is a function of $p\in [0,1]$ …

    iastate Repository record for The edit distance function: Forbidding induced powers of cycles and other questions (opens in a new tab)

  11. Simultaneous Embedding and Level Planarity

    … same vertex set (same entities) but different edge sets (different relationships). Level planarity arises in the layout of graphs that contain hierarchical relationships. When drawing graphs in the plane, this translates to a restricted form of planarity where the vertical order of the entities …

    arizona-thes Repository record for Simultaneous Embedding and Level Planarity (opens in a new tab)

  12. Large Language Models and Networks: Edge Proposal, Synthetic Corpora, and Adaptive Node Generation

    … between text-described entities, we recover edge sets that reconstruct social, thematic, and citation graphs with high precision, revealing how attention distributions encode topological cues. Recognizing the difficulty of benchmarking such capabilities on noisy real-world corpora, the work …

    ucf Repository record for Large Language Models and Networks: Edge Proposal, Synthetic Corpora, and Adaptive Node Generation (opens in a new tab)

  13. Approximation Algorithms for New Problems in Network Design

    … after bounded faults. We also study hopsets, another network design object. Hopsets are edge sets that, when added to a particular graph, introduce low-hop paths that approximately preserve the distances of the original graph. For decades, hopsets have found a wide range of applications …

    jhu Repository record for Approximation Algorithms for New Problems in Network Design (opens in a new tab)

  14. Forest Generating Functions of Directed Graphs

    … variables are indexed over both the vertex and edge sets of a given directed graph. In this thesis, we establish a general framework to study spanning forest polynomials, associating them with a generalized Laplacian matrix and studying its properties. We introduce a novel proof of the famous …

    portland-state Repository record for Forest Generating Functions of Directed Graphs (opens in a new tab)

  15. Global-Scale 3D Building Reconstruction from Aerial LiDAR Point Clouds

    … the lack of large-scale, high-quality datasets, limited automation, limited robustness to incomplete observations, and weak generalization to diverse real-world scenarios. To address these challenges, this thesis is dedicated to the study of global-scale 3D building reconstruction from APC. …

    calgary Repository record for Global-Scale 3D Building Reconstruction from Aerial LiDAR Point Clouds (opens in a new tab)

  16. 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)

  17. The Minimum Rank Problem for Outerplanar Graphs

    … such that any two line segments representing edges of G intersect only at a point which represents a vertex of G. A planar drawing partitions the rest of the plane into open regions called faces. A graph is outerplanar if there exists a planar drawing of G such that every vertex lies on the …

    byu Repository record for The Minimum Rank Problem for Outerplanar Graphs (opens in a new tab) Download PDF for The Minimum Rank Problem for Outerplanar Graphs (opens in a new tab)

  18. (Relaxed) Product Structures of Graphs and Hypergraphs

    … In addition, we examine relations on the edge sets of \\emph{hyper}graphs that satisfy the grid property, the hypergraph analog of the square property. We introduce the \\emph{strong} and the \\emph{relaxed} grid property as variations of the grid property, the latter generalizing the …

    qucosa-diss

  19. Scalable clustering algorithms and optimization methods for parallel architectures

    … as network systems or graphs with node and edge sets. The practical applications of graph clustering algorithms are nowadays popular social networks, biological research, marketing and financial products. The methodology presented in this thesis investigates and filters only those clustering …

    washington Repository record for Scalable clustering algorithms and optimization methods for parallel architectures (opens in a new tab)

Page 1 of 2