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 507 for “"undirected"”.

  1. Modular decomposition of undirected graphs

    … to easily compute: modular decomposition of an undirected graph, partition an undirected graph, depth first search on a directed partially complemented graph, and stack operations with a complement stack. The provided implementation of these problems all compute within the time bound discussed …

    colostate Repository record for Modular decomposition of undirected graphs (opens in a new tab)

  2. Transitive Subgraphs Of Undirected And Directed Graphs.

    … so that the remaining subgraph is transitive. Undirected graphs on n points with maximum cut number are characterized and the maximum calculated in this case. For directed graphs, the problem is much more difficult; only partial results are obtained. In Section IV, we ask for conditions for the …

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

  3. Locating absolute 2-centers of undirected graphs

    … location of vertex and absolute 2-centers of an undirected graph. Under certain assumptions, these locations would be useful for determining the optimal positioning of emergency facilities such as fire stations. Vertex and absolute multi-centers are defined, and a procedure for locating the …

    nps Repository record for Locating absolute 2-centers of undirected graphs (opens in a new tab)

  4. Adjacency spectral embedding beyond unweighted, undirected networks

    … networks beyond those with unweighted and undirected edges. This thesis considers the statistical analysis of adjacency spectral embedding beyond these standard networks. By embedding the nodes of these networks into low dimensional space in a consistent and meaningful manner, it is …

    bristol Repository record for Adjacency spectral embedding beyond unweighted, undirected networks (opens in a new tab) Download PDF for Adjacency spectral embedding beyond unweighted, undirected networks (opens in a new tab)

  5. The Quantum Automorphism Group and Undirected Trees

    A classification of all undirected trees with automorphism group isomorphic to $(Z_2)^l$ is given in terms of a vertex partition called a refined star partition. Recently the notion of a quantum automorphism group has been defined by T. Banica and J. Bichon. The quantum automorphism group is …

    vt Repository record for The Quantum Automorphism Group and Undirected Trees (opens in a new tab)

  6. Link scheduling directed graphs using undirected edge colours

    … is typically modeled as either a directed or an undirected communication graph. Link scheduling is the problem of assigning time slots to each edge so that communication on every edge at its assigned time may occur without interference. Interference is also modeled as a graph, typically the same …

    ubc Repository record for Link scheduling directed graphs using undirected edge colours (opens in a new tab) Download PDF for Link scheduling directed graphs using undirected edge colours (opens in a new tab)

  7. Monte Carlo integration in discrete undirected probabilistic models

    … to the field of Monte Carlo sampling for undirected graphical models, a class of statistical model commonly used in machine learning, computer vision, and spatial statistics; the aim is to be able to use the methodology and resultant samples to estimate integrals of functions of the …

    ubc Repository record for Monte Carlo integration in discrete undirected probabilistic models (opens in a new tab) Download PDF for Monte Carlo integration in discrete undirected probabilistic models (opens in a new tab)

  8. Erdos-Posa theorems for undirected group-labelled graphs

    … and paths by developing new structural tools for undirected group-labelled graphs. Our first result is a refinement of the flat wall theorem of Robertson and Seymour to undirected group-labelled graphs. This structure theorem is then used to prove the Erdős-Pósa property of A-paths of length 0 …

    gatech Repository record for Erdos-Posa theorems for undirected group-labelled graphs (opens in a new tab)

  9. Learning value functions from undirected state-only experience

    Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2023-04-12 without embargo terms

    uiuc Repository record for Learning value functions from undirected state-only experience (opens in a new tab)

  10. Advances in Bayesian Approaches for Directed and Undirected Graphical Models

    … Graphical models can capture both directed and undirected relationships, which may arise from a variety of underlying distributions. This flexibility has made them applicable across many fields of study. In this thesis we advance the research on Bayesian methods for graphical model inference by …

    rice Repository record for Advances in Bayesian Approaches for Directed and Undirected Graphical Models (opens in a new tab)

  11. Reweighted Eigenvalues: A New Approach to Spectral Theory beyond Undirected Graphs

    … to extend spectral graph theory beyond undirected graphs. Our main motivation is to derive Cheeger inequalities and spectral rounding algorithms for a general class of graph expansion problems, including vertex expansion and edge conductance in directed graphs and hypergraphs. The goal …

    waterloo Repository record for Reweighted Eigenvalues: A New Approach to Spectral Theory beyond Undirected Graphs (opens in a new tab)

  12. Inferring Undirected and Causally Directed Graph Structures from Multivariate Time Series

    … cortex of primates using a novel variation of undirected graph learning based on smoothness prior. In Part Two, we define and implement a novel spatiotemporal graph (STG) model for inferring causally directed graphs. Analysis of brain connectivity networks has a potential to advance our …

    claremont Repository record for Inferring Undirected and Causally Directed Graph Structures from Multivariate Time Series (opens in a new tab)

  13. Triangle counting and listing in directed and undirected graphs using single machines

    … algorithms for both directed and undirected graphs, and searched for methods to do the computation on a single machine. Through detailed analysis, we found some ways to improve the efficiency of the computation. Programs that implement the algorithms were built and tested on large …

    uvic Repository record for Triangle counting and listing in directed and undirected graphs using single machines (opens in a new tab)

  14. A Design of Computer Aided Instructions (CAI) For Undirected Graphs In The Discrete Math Tutorial (DMT)

    … is :o create a tutorial for teaching aspects of "undirected graphs" in discrete math. It is one of the submodules of the Discrete Math Tutorial (DMT), which is a Computer Aided Instructional (CAI) tool for teaching discrete math to the Naval Academy and the Westpoint Military Academy students. In …

    nps Repository record for A Design of Computer Aided Instructions (CAI) For Undirected Graphs In The Discrete Math Tutorial (DMT) (opens in a new tab)

  15. Statistical models for social support networks: Application of exponential models to undirected graphs with dyadic dependencies

    Research on the relationship between social support and general well-being often focuses on the personal support network, the group of individuals upon whom one calls for assistance in any given situation. With more sophisticated theories of social support, researchers no longer consider the mere …

    uiuc Repository record for Statistical models for social support networks: Application of exponential models to undirected graphs with dyadic dependencies (opens in a new tab)

Page 1 of 26