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 26 for “"Oriented Graph"”.

  1. Object-oriented graph grammars

    Esta tese apresenta um modelo conceitual para modelagem e vericação de espe- cificações de sistemas orientados a objeto. Mais especificiamente, uma extensão da abordagem algébrica baseada em single-pushouts para gramáticas de grafos tipadas é desenvolvida, onde os morfismos de tipagem são …

    brazil-ufrgs Repository record for Object-oriented graph grammars (opens in a new tab)

  2. Hydrodynamic limit and fluctuations of the zero range process on a randomly oriented graph

    … particle systems on asymmetric random graphs. Motivated by results on non-reversible random walks in random environments obtained by Kozma and Toth, our aim is to study interacting particle systems on graphs subject to comparable conditions. We study the mean-zero zero range process on …

    bristol Repository record for Hydrodynamic limit and fluctuations of the zero range process on a randomly oriented graph (opens in a new tab) Download PDF for Hydrodynamic limit and fluctuations of the zero range process on a randomly oriented graph (opens in a new tab)

  3. On cycles in directed graphs

    … that for each alpha > 0 every sufficiently large oriented graph G with minimum indegree and minimum outdegree at least 3 |G| / 8 + alpha |G| contains a Hamilton cycle. This gives an approximate solution to a problem of Thomassen. Furthermore, answering completely a conjecture of Haggkvist and …

    birmingham Download PDF for On cycles in directed graphs (opens in a new tab)

  4. Obstructions for local tournament orientation completions

    … completion problem for a hereditary class C of oriented graphs asks whether a given partially oriented graph can be completed to a graph belonging to C. This problem was introduced recently and is a generalization of several existing problems, including the recognition problem for certain …

    uvic Repository record for Obstructions for local tournament orientation completions (opens in a new tab)

  5. Discrete Quantum Walks on Graphs and Digraphs

    … various models of discrete quantum walks on graphs and digraphs via a spectral approach. A discrete quantum walk on a digraph $X$ is determined by a unitary matrix $U$, which acts on complex functions of the arcs of $X$. Generally speaking, $U$ is a product of two sparse unitary matrices, …

    waterloo Repository record for Discrete Quantum Walks on Graphs and Digraphs (opens in a new tab)

  6. Quantum Walks on Oriented Graphs

    … about periodicity and perfect state transfer to oriented graphs. We prove that if a vertex a is periodic, then elements of the eigenvalue support lie in Z √∆ for some squarefree negative integer ∆. We find an infinite family of orientations of the complete graph that are periodic. We find an …

    waterloo Repository record for Quantum Walks on Oriented Graphs (opens in a new tab)

  7. 2-dipath and proper 2-dipath k-colourings

    A 2-dipath k-colouring of an oriented graph G is an assignment of k colours, 1,2, . . . , k, to the vertices of G such that vertices joined by a directed path of length two are assigned different colours. The 2-dipath chromatic number is the minimum number of colours needed in such a colouring. …

    uvic Repository record for 2-dipath and proper 2-dipath k-colourings (opens in a new tab)

  8. Reflexive injective oriented colourings

    We define a variation of injective oriented colouring as reflexive injective oriented colouring, or rio-colouring for short, which requires an oriented colouring to be injective on the neighbourhoods of the underlying graph, without requiring the colouring to be proper. An analysis of the …

    uvic Repository record for Reflexive injective oriented colourings (opens in a new tab)

  9. TOWARDS UTILITY-ORIENTED AND SCALABLE GRAPH LEARNING

    Graphs are indispensable for modeling complex systems such as social networks, e-commerce platforms, financial transactions, and molecular interactions. However, maximizing the utility—i.e., the effectiveness of graph representations for downstream tasks—of these complex structures faces …

    nus Repository record for TOWARDS UTILITY-ORIENTED AND SCALABLE GRAPH LEARNING (opens in a new tab) Download file for TOWARDS UTILITY-ORIENTED AND SCALABLE GRAPH LEARNING (opens in a new tab)

  10. SOME EXTREMAL PROBLEMS UNDER GROWTH/EXPANSION CONSTRAINTS

    … existence of a 0.715538-Seymour vertex in every oriented graph. This result provides the first improvement to the best known constant factor in more than two decades. Chapter 3 focuses on the Small Quasi-Kernel Conjecture (SQC) by P.L. Erdos and Szekely. Recently, Spiro posed the Large …

    nus Repository record for SOME EXTREMAL PROBLEMS UNDER GROWTH/EXPANSION CONSTRAINTS (opens in a new tab) Download file for SOME EXTREMAL PROBLEMS UNDER GROWTH/EXPANSION CONSTRAINTS (opens in a new tab)

  11. Transitive Subgraphs Of Undirected And Directed Graphs.

    A graph G is transitive if it is transitive when considered as a relation; i.e., if the edges ab and be are in G, so is ac. In this paper, several natural questions concerning transitivity and related concepts are investigated. Because the terminology and notation of graph theory is not standard, a …

    unm Repository record for Transitive Subgraphs Of Undirected And Directed Graphs. (opens in a new tab)

  12. The Linkage Problem for Group-labelled Graphs

    … thesis aims to extend some of the results of the Graph Minors Project of Robertson and Seymour to "group-labelled graphs". Let $\Gamma$ be a group. A $\Gamma$-labelled graph is an oriented graph with its edges labelled from $\Gamma$, and is thus a generalization of a signed graph. Our primary …

    waterloo Repository record for The Linkage Problem for Group-labelled Graphs (opens in a new tab)

  13. GNN-based Handover Management in 5G Vehicular Networks

    … In this study, we propose TH-GCN (Throughput-oriented Graph Convolutional Network), which optimizes handover management in dense 5G environments using graph neural networks (GNNs). TH-GCN predicts optimal connections and the best handover choices by modeling vehicles and towers as nodes in a …

    brock Repository record for GNN-based Handover Management in 5G Vehicular Networks (opens in a new tab)

  14. Partitions of random graphs, invertibility of digraphs and the Erdős-Rothschild problem

    … degree congruence conditions in random graphs. For G = Gn,1/2, the Erdős–Renyi random graph, let Xn be the random variable representing the number of distinct partitions of V (G) into sets A1, . . . , Aq so that the degree of each vertex in G[Ai ] is divisible by q for all i ∈ [q]. We …

    oxford Repository record for Partitions of random graphs, invertibility of digraphs and the Erdős-Rothschild problem (opens in a new tab)

  15. Enumeration of small triangle free Ramsey Graphs

    … study of Ramsey's Theorem is that of a Ramsey graph. A Ramsey graph, denoted (k,l,n,e), is defined as an undirected graph that contains no cliques of size k, no independent sets of size I, with order n, and size e. Knowledge of Ramsey graphs is useful in the improvement of bounds and sometimes …

    rit Repository record for Enumeration of small triangle free Ramsey Graphs (opens in a new tab)

  16. Efficient Subgraph Computing on Large-Scale Graphs

    The problem of efficiently computing subgraphs has received much attention from the database research community. In this thesis, we study important problem of efficient graph analysis at a large scale. Three subgraph computation problems are studied. These problems are (1) Triangle Listing, (2) …

    unsw Repository record for Efficient Subgraph Computing on Large-Scale Graphs (opens in a new tab)

  17. Previsão e identificação de eventos de quebra de segurança em vídeo-vigilância

    … dois classificadores (N-ary Trees e Dynamic Oriented Graph) que, utilizando os dados provenientes das funções de processamento e análise de imagem, permitem modelar sequências temporais. O sistema final, constituído pela junção dos múltiplos componentes propostos e implementado numa câmara de …

    minho-thes Repository record for Previsão e identificação de eventos de quebra de segurança em vídeo-vigilância (opens in a new tab)

  18. Representation type and Auslander-Reiten theory of Frobenius-Lusztig kernels

    … and the irreducible maps are arranged in an oriented graph, the Auslander-Reiten quiver. We are interested in the shape of the connected components of this quiver. In the tame and representation-finite cases, the Auslander-Reiten quiver of the Frobenius-Lusztig kernels is completely …

    cau-kiel Repository record for Representation type and Auslander-Reiten theory of Frobenius-Lusztig kernels (opens in a new tab)

  19. Inventory management at Finning Ltd.

    … problem was approached through the use of a time-oriented graph rather than a physical graph. With this approach in mind, the graph was constructed and an algorithm developed which ensures that the optimal transportation route is selected. The purpose of the second project was to improve the …

    ubc Repository record for Inventory management at Finning Ltd. (opens in a new tab) Download PDF for Inventory management at Finning Ltd. (opens in a new tab)

Page 1 of 2