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 97 for “"Undirected graphs"”.

  1. Modular decomposition of undirected graphs

    Graphs found in nature tend to have structure and interesting compositions that allow for compression of the information and thoughtful analysis of the relationships between vertices. Modular decomposition has been studied since 1967 [1]. Modular decomposition breaks a graph down into smaller …

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

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

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

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

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

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

  7. Capture and reconstruction of the topology of undirected graphs from partial coordinates: a matrix completion based approach

    … The surge of interest in research towards graphs and topology can be attributed to important applications such as graph representation of words in computational linguistics, identification of terrorists for national security, studying complicated atomic structures, and modeling connectivity …

    colostate Repository record for Capture and reconstruction of the topology of undirected graphs from partial coordinates: a matrix completion based approach (opens in a new tab)

  8. Evaluation and Enumeration of Regular Simple Path and Trail Queries

    … trail semantics. Evaluation Problem on Directed Graphs: Bagan, Bonifati, and Groz gave a trichotomy for the evaluation problem for simple paths when the RPQ is fixed. We complement their work by giving a similar trichotomy for the evaluation problem for trails and studying various characteristics …

    bayreuth Repository record for Evaluation and Enumeration of Regular Simple Path and Trail Queries (opens in a new tab)

  9. Computational complexity of digraph decomposition and the congruence extension property for algebras

    … find the unique prime factorization of connected graphs under the strong direct product. In this paper, we show that weakly connected directed graphs have unique prime factorizations with respect to the strong direct product, and we give a polynomial-time algorithm to find the prime factorizations …

    iastate Repository record for Computational complexity of digraph decomposition and the congruence extension property for algebras (opens in a new tab)

  10. Vertex Connectivity of Graphs: Algorithms and Bounds

    … problems concerning vertex connectivity of undirected graphs and presents new bounds and algorithms for these problems.

    uiuc Repository record for Vertex Connectivity of Graphs: Algorithms and Bounds (opens in a new tab)

  11. Odd multiway cut in directed acyclic graphs

    … parameterized by the size of the solution in undirected graphs. In this work, we focus on directed acyclic graphs (DAGs) and design a fixed-parameter algorithm. Our main contribution is a broadening of the shadow-removal framework to address parity problems in DAGs. We complement our FPT …

    uiuc Repository record for Odd multiway cut in directed acyclic graphs (opens in a new tab)

  12. Algebraic Digraph Theory

    … the literature in algebraic graph theory studies undirected graphs. In this thesis, we consider the case of digraphs. We show that it is not the spectrum of the adjacency matrix that is important but rather the unitary equivalence class to which it belongs. For undirected graphs, the adjacency …

    guelph Repository record for Algebraic Digraph Theory (opens in a new tab)

  13. Exact Byzantine consensus under local-broadcast channels

    … that under this model consensus is possible on undirected graphs that have $2f+1$ nodes and are $2f$-connected. In contrast, it is well known that with point-to-point links, achieving consensus requires at least $3f+1$ nodes and $2f + 1$ connectivity. We show a tight result for the case of a …

    uiuc Repository record for Exact Byzantine consensus under local-broadcast channels (opens in a new tab)

  14. On Kernels, β-graphs, and β-graph Sequences of Digraphs

    … of kernels in various classes of directed graphs, most notably in oriented trees, grid graphs, and oriented cycles. The question of uniqueness of these kernels is also handled. Attention is then shifted to $\gamma$-graphs, structures associated to the minimum dominating sets of undirected …

    ku Repository record for On Kernels, β-graphs, and β-graph Sequences of Digraphs (opens in a new tab)

  15. Estimation of Gaussian Networks and Modular Brain Functional Networks

    … relation between variables of interest. Both undirected and directed graphical models are widely used in many applications, such as reconstructing gene expression/co-expression networks and brain functional networks. A popular model for undirected graphs is the Gaussian graphical model, where …

    umn Repository record for Estimation of Gaussian Networks and Modular Brain Functional Networks (opens in a new tab)

  16. Modular Algorithms for Biomolecular Network Alignment

    … networks. The algorithm is applicable to (1) undirected graphs in their weighted and unweighted variations (2) undirected graphs in their labeled and unlabeled variations (3) and has been applied to align multiple networks from hundreds of nodes with a few thousand edges to networks with tens …

    iastate Repository record for Modular Algorithms for Biomolecular Network Alignment (opens in a new tab)

  17. Quantum Grover's Oracles with Symmetry Boolean Functions

    … two graph theory problems: cycle detection of undirected graphs and generalized hypercube partitioning. We present a novel method to design a quantum oracle to solve Boolean function minimization problems which occur in classical circuit optimization.

    portland-state Repository record for Quantum Grover's Oracles with Symmetry Boolean Functions (opens in a new tab)

  18. Solving the maximum clique problems on a class of network graphs, with applications to social networks

    … We formulate the maximum clique problem on undirected graphs and develop two algorithms to solve it: a pruning algorithm and an enumeration algorithm. The pruning algorithm successively improves an upper bound on the clique number of a graph, and the enumeration algorithm successively finds …

    nps Repository record for Solving the maximum clique problems on a class of network graphs, with applications to social networks (opens in a new tab)

  19. Extending two drawing frameworks to create LaTeX picture environments

    … picture environment commands. With these tools, graphs can be drawn and manipulated on a GUI, and then saved into a TeX file directly. Both tools support the basic drawing commands, which allow drawing graph or connected graphs be composed of elements such as lines, vector, ellipses, rectangle, …

    concordia Download PDF for Extending two drawing frameworks to create LaTeX picture environments (opens in a new tab)

Page 1 of 5