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 10 of 10 for “"labeled graph"”.
-
Parallel algorithms for labeled graph matching
Includes bibliographical references (pages 114-122).
-
On labeled paths
Labeled graph theory is the marriage of two common problem domains to computer science -- graph theory and automata theory. Though each has been independently studied in depth, there has been little investigation of their intersection, the labeled paths. This dissertation examines three results in …
-
Bounding the Number of Graphs Containing Very Long Induced Paths
Induced graphs are used to describe the structure of a graph, one such type of induced graph that has been studied are long paths. <p>In this thesis we show a way to represent such graphs in terms of an array with two colors and a labeled graph. Using this representation and the techniques of Polya …
-
Generalizations and Variations on Graph Pebbling
Graph pebbling involves determining the minimum number of pebbles needed so that regardless of the initial arrangement of pebbles on a graph, a pebble can be moved to any vertex using specified ``pebbling moves.'' This minimum number of pebbles is the pebbling number of a graph. We begin by making …
-
Design of Deryaft : a novel framework for generating representation invariants of structurally complex data
… structural invariants, this approach focuses on graph properties, including reachability, and views the program heap as an edge-labeled graph. The Deryaft Tool implements this approach for Java. Deryaft outputs a Java predicate that represents the invariants; the predicate takes an input …
-
Deep Representation Learning on Labeled Graphs
… has also recently been applied to data with graph structures. We identify the drawbacks of existing deep frameworks for generating graphs, and we propose labeled-graph generative adversarial networks (LGGAN) to train deep generative models for graph-structured data with node labels. We test …
-
In solving the dominating set problem : group theory approach
… a new way to find the dominating set of a graph by introducing the concept of an orbit graph and a weighted dominating set. We showed that the Blokhuis-Lam method for the football pool problem is a special case of assuming that the solution has a non-trivial automorphism group. A general …
-
Predicting unknown adverse drug reactions using an unsupervised node embedding algorithm
… to run prediction tasks on different types of labeled graph data. The framework first creates a knowledge graph from the data and then uses an unsupervised algorithm to create embeddings (vector representations) of the nodes in the knowledge graph, and finally runs the prediction task. The …
-
Multi-agent, multi-objective path planning in complex environments
… priori unknown. We present the environment as a labeled graph where the labels of states are initially unknown, and consider a motion planning objective to fulfill a combination of reach-avoid specifications given on these labels in minimum time. By describing the record of visited labels as an …
-
PROBABILISTIC MODELS FOR DEPENDENT VARIABLES: COMPLEX ANALYTIC AND COMBINATORIAL APPROACHES
… concepts of vines in probability theory and MAT-labeled graphs in hyperplane arrangement theory. We show that there exists an explicit equivalence between the categories of locally regular vines and MAT-labeled graphs. Several applications will be mentioned to illustrate the interaction between …