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 21 for “"Representations of graphs"”.

  1. Intersections and Representations of Graphs

    Given two graphs G and H sharing the same vertex set, the edge-intersection spectrum of G and H is the set of possible sizes of the intersection of the edge sets of both graphs. For example, the spectrum of two copies of the cycle C5 is {0, 2, 3, 5}, and the spectrum of two copies of the star K1,r …

    clemson Repository record for Intersections and Representations of Graphs (opens in a new tab)

  2. Intersection representations of graphs and digraphs

    … if and only if its adjacency matrix is free of six forbidden submatrices: three 3 by 4 matrices and their transposes.

    uiuc Repository record for Intersection representations of graphs and digraphs (opens in a new tab)

  3. Continued fractions and representations of graphs

    Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2020-08-25 without embargo terms

    uiuc Repository record for Continued fractions and representations of graphs (opens in a new tab)

  4. Geometric Representations of Graphs: Theory and Application

    Graph Drawing is a field of research that has application in any field of science that needs to visualize binary relations. This thesis covers various problems arising when drawing graphs, both in theoretical and applied settings. In the first and more theory-based part, we start by discussing how …

    wurz-thes Repository record for Geometric Representations of Graphs: Theory and Application (opens in a new tab)

  5. Tropical Arithmetics and Dot Product Representations of Graphs

    … for multiplication. A dot product representation of a graph assigns each vertex of the graph a vector such that two edges are adjacent if and only if the dot product of their vectors is greater than some chosen threshold. The resultS of creating dot product representations of graphs using tropical …

    utahstate Repository record for Tropical Arithmetics and Dot Product Representations of Graphs (opens in a new tab)

  6. Contact Representations of Graphs in 2D and 3D

    We study contact representations of graphs in the plane and in 3D space, where vertices are represented by polygons or polyhedra and each edge is represented by a common boundary between two polygons or polyhedra. In the weighted version of the problem, we find contact representations with the …

    arizona-thes Repository record for Contact Representations of Graphs in 2D and 3D (opens in a new tab)

  7. Node-Link, Obstacle, and Intersection Representations of Graphs and Hypergraphs

    Graphs and hypergraphs model relationships between objects in various fields such as computer science, social networks, biology, and others. Graphs consist of vertices connected by edges, while hypergraphs extend this concept by allowing hyperedges to connect multiple vertices simultaneously. …

    wurz-thes Repository record for Node-Link, Obstacle, and Intersection Representations of Graphs and Hypergraphs (opens in a new tab)

  8. To Dot Product Graphs and Beyond

    We will introduce three new vector representations of graphs. These representations are based on relationships between the vectors that are used. Specifically, we will examine scenarios where we ignore specific relationships, where we consider if information is missing, and where we look for when …

    utahstate Repository record for To Dot Product Graphs and Beyond (opens in a new tab)

  9. Exploring Graph Neural Networks for Clustering and Classification

    … to solve complex real-world problems. Because graphs provide an efficient approach to contriving abstract hypothetical concepts, modern research overcomes the limitations of classical graph theory, requiring prior knowledge of the graph structure before employing traditional algorithms. GNNs, …

    iupui Repository record for Exploring Graph Neural Networks for Clustering and Classification (opens in a new tab)

  10. On a graph parameter related to vertex labelings and its application to minimum rank problems in graph theory

    … rank and minimum positive semidefinite rank of a simple graph. A graph parameter, called the minimum labeling degree (mld), is defined in terms of the concept of a vertex labeling of a graph, and its value is calculated for a few graph classes. It is proved here that there is a conception of …

    utc Repository record for On a graph parameter related to vertex labelings and its application to minimum rank problems in graph theory (opens in a new tab)

  11. Exploring the powers of stacks and queues via graph layouts

    … dissertation we employ stack and queue layouts of graphs to explore the relative power of stacks and queues. Stack layout and queue layouts of graphs can be examined from several points of view. A stack or a queue layout of a graph can be thought of as an embedding of the graph in a plane …

    vt Repository record for Exploring the powers of stacks and queues via graph layouts (opens in a new tab)

  12. Restricted String Representations

    A string representation of a graph assigns to every vertex a curve in the plane so that two curves intersect if and only if the represented vertices are adjacent. This work investigates string representations of graphs with an emphasis on the shapes of curves and the way they intersect. We …

    waterloo Repository record for Restricted String Representations (opens in a new tab)

  13. Geometric Ramifications of the Lovász Theta Function and Their Interplay with Duality

    … and deep connections to the geometric concept of orthonormal representations of graphs. In this thesis, we investigate several ramifications of the theory underlying these objects, including those arising from the illuminating viewpoint of duality. We study some optimization problems over …

    waterloo Repository record for Geometric Ramifications of the Lovász Theta Function and Their Interplay with Duality (opens in a new tab)

  14. Equilibrium graphs on the flat torus or finding zen amidst the bull

    … spring embedding theorem, and equilibrium graphs on the plane in general, have been a subject of study for many decades, with connections to and applications in many areas, including, but not limited to, discrete geometry, planar graph theory, graphics, surface parametrization, mechanical …

    uiuc Repository record for Equilibrium graphs on the flat torus or finding zen amidst the bull (opens in a new tab)

  15. Structural Entropy-based Methods in Graph Representation Learning

    This thesis investigates the application of Structural Entropy (SE) based methods on Graph Representation Learning (GRL), a popular approach in graph processing within Artificial Intelligence. GRL methods aim to provide encoder functions that generate vectorized representations of graphs. These …

    auckland-ms Repository record for Structural Entropy-based Methods in Graph Representation Learning (opens in a new tab)

  16. Spatio-Temporal Representation for Reasoning with Action Genome

    … actions that can provide a better understanding of the activity. This paper tries to represent the varying information in a scene-graph format in order to answer temporal questions to obtain improved insights for the video, resulting in a directed temporal information graph. This project will use …

    ucf Repository record for Spatio-Temporal Representation for Reasoning with Action Genome (opens in a new tab)

  17. On Numerical Methods for Efficient Deep Neural Networks

    The advent of deep neural networks has revolutionized a number of areas in machine learning, including image recognition, speech recognition, and natural language processing. Deep neural networks have demonstrated massive generalization power, with which domain-specific knowledge in certain machine …

    washington Repository record for On Numerical Methods for Efficient Deep Neural Networks (opens in a new tab)

Page 1 of 2