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 17 of 17 for “"Graph Isomorphism"”.
-
Graph Isomorphism Algorithms Based on Trees and Paths.
… bounded algorithms are presented for testing isomorphism of two classes of graphs: the strongly regular graphs, which have been difficult for many previous isomorphism algorithms to process, and the compact graphs (graphs with diameter of 2 whose complements also have diameter of 2).The …
-
Variations on the Theme of Higher Dimensional Weisfeiler-Leman Algorithms
… power of known combinatorial and algebraic graph invariants. Using the language of refinement operators (introduced in [32]) we derive known results relating the Weisfeiler-Leman algorithms and the invertible map tests. The former are a well known family of polynomial time algorithms …
-
On the Unique Tree Representation of Graphs
<p>This dissertation investigates classes of graphs which admit tree representations unique up to isomorphism. The definitions of these classes are based on local properties of P<sub>4</sub>'s, A template structure theorem is given which illustrates the nature of the local properties. The template …
-
Topics in quantum algorithms : adiabatic algorithm, quantum money, and bomb query complexity
… can not be cloned in a black box way unless graph isomorphism is efficiently solvable by a quantum computer. Lastly we defined a modified quantum query model, which we called bomb query complexity B(J), inspired by the Elitzur-Vaidman bomb-testing problem. We completely characterized bomb …
-
Solving Graph Problems with Large Language Models
… to solve classical computational problems on graphs. Graphs are a fundamental abstraction for representing real-world systems, such as social, transportation, and communication networks, but they pose unique challenges: their structure is not tied to any fixed ordering of nodes (graph …
-
A study of efficient secret sharing
… are not known to be in NC, namely Bounded-Degree Graph Isomorphism and constant-dimensional lattice problems. In particular, this gives us the first combinatorial access structure that is conjectured to be outside NC but has an efficient secret-sharing scheme. Previous such constructions (Beimel …
-
On Ranked Approximate Matching Of Large Attributed Graphs
… database applications entail sophisticated graph based query manipulation, predominantly evident in large-scale</p> <p>scientific applications. To access the information embedded in</p> <p>graphs, efficient graph matching tools and algorithms have become of prime importance. Although the …
-
Delegating computation reliably : paradigms and constructions
… touches on foundational questions in cryptography and complexity theory. The focus of this thesis is verifying the correctness of delegated computations. We construct efficient protocols (interactive proofs) for delegating computational tasks. In particular, we present: e A protocol for …
-
Scalable validation of binary lifters
… and the lifter output is then reduced to a graph-isomorphism check through the use of semantic preserving transformations. The translation validation of instructions in isolation revealed 29 new bugs in McSema – a mature open-source lifter from x86-64 to LLVM IR. Towards the validation of …
-
Modern Interactive Proofs
… proofs, have found applications in cryptography and hardness of approximation. An important open problem is characterizing the power of non-signaling proofs. It is known that 2-prover non-signaling proofs are characterized by PSPACE, and that non- signaling proofs with poly(𝑛)- provers are …
-
Real-time analytics for complex structure data
… complex relationships are often represented as graphs to denote the content of the data entries and their structural relationships, where instances (nodes) are not only characterized by the content but are also subject to dependency relationships. Plus, real-time availability is one of …
-
Indexing and Retrieval of 3D Articulated Geometry Models
… 3D models are essential components in nowadays graphic applications, and are widely used in the game, animation and movies production industry. With the increasing number of these models, a search engine not only provides an entrance to explore such a huge dataset, it also facilitates sharing …
-
A general computational tool for structure synthesis
… concepts: (1) the structure is represented by a graph and further by the adjacency matrix; and (2) instead of only exploiting the eigenvalue of the adjacency matrix, both the eigenvalue and the eigenvector are exploited; specifically the components of the eigenvector have been found very useful …
-
Development, evaluation, and In-vitro assessment of artificial intelligence antidiabetic predictive models from α-glucosidase inhibitors
… deep learning models were created using Graph Neural Networks (GNNs) architectures, including Graph Convolutional Networks (GCN), Graph Attention Networks (GAT), Graph Isomorphism Networks (GIN), and Attentive Fingerprints (AFP). The GNNs work directly with molecular graphs, where atoms …