An approach to Graph Isomorphism using Spanning Trees generated by Breadth First Search

An approach to Graph Isomorphism using Spanning Trees generated by Breadth First Search

Bibliographic Details
Main Author:	Ilchenko, Alexey
Language:	English
Published:	Case Western Reserve University School of Graduate Studies / OhioLINK 2014
Subjects:	Mathematics graph isomorphism spanning tree breadth first search random graph
Online Access:	http://rave.ohiolink.edu/etdc/view?acc_num=case1405079402

Similar Items

Efficient Breadth-First Reduct Search
by: Veera Boonjing, et al.
Published: (2020-05-01)

Top-Down Construction of Independent Spanning Trees in Alternating Group Networks
by: Jie-Fu Huang, et al.
Published: (2020-01-01)

A Graph-Based Min-# and Error-Optimal Trajectory Simplification Algorithm and Its Extension towards Online Services
by: Fan Wu, et al.
Published: (2017-01-01)

The Spanning Tree of a Divisible Multiple Graph
by: Alexander V. Smirnov
Published: (2018-08-01)

Tree Graphs and Orthogonal Spanning Tree Decompositions
by: Mahoney, James Raymond
Published: (2016)

Subgraph Isomorphism Search In Massive Graph Data
by: Nabti, Chems Eddine
Published: (2017)

Applications of Lexicographic Breadth-first Search to Modular Decomposition, Split Decomposition, and Circle Graphs
by: Tedder, Marc
Published: (2011)

Applications of Lexicographic Breadth-first Search to Modular Decomposition, Split Decomposition, and Circle Graphs
by: Tedder, Marc
Published: (2011)

Building direct and back spanning trees by automata on a graph
by: Igor Burdonov, et al.
Published: (2018-10-01)

NP-completeness of the Minimum Spanning Tree Problem of a Multiple Graph of Multiplicity k ≥ 3
by: Alexander Valeryevich Smirnov
Published: (2021-03-01)

The Implementation of Kruskal’s Algorithm for Minimum Spanning Tree in a Graph
by: Paryati, et al.
Published: (2021-01-01)

Enumeration for spanning trees and forests of join graphs based on the combinatorial decomposition
by: Sung Sik U
Published: (2016-10-01)

Minimum Degree Spanning Trees on Bipartite Permutation Graphs
by: Smith, Jacqueline
Published: (2011)

Graph Compression by BFS
by: Alberto Apostolico, et al.
Published: (2009-08-01)

Spanning Trees of Certain Types
by: Jayasooriya Arachchilage, Dinush Lanka Panditharathna
Published: (2016)

Two Algorithms for Computing All Spanning Trees of a Simple, Undirected, and Connected Graph: Once Assuming a Complete Graph
by: Maumita Chakraborty, et al.
Published: (2018-01-01)

Spanning tree modulus: deflation and a hierarchical graph structure
by: Clemens, Jason
Published: (2018)

Spanning k-ended trees of 3-regular connected graphs
by: Hamed Ghasemian Zoeram, et al.
Published: (2017-10-01)

An Efficient Subgraph Isomorphism Solver for Large Graphs
by: Zubair Ali Ansari, et al.
Published: (2021-01-01)

Note: Sharp Upper and Lower Bounds on the Number of Spanning Trees in Cartesian Product of Graphs
by: Azarija Jernej
Published: (2013-09-01)

Recognition and isomorphism algorithms for circular permutation graphs
by: Gardner, Bonnie Lyn Hollenbach
Published: (2006)

Completely Independent Spanning Trees in k-Th Power of Graphs
by: Hong Xia
Published: (2018-08-01)

An Isomorphism Problem in Z^2
by: Matt Noble
Published: (2015-01-01)

Connected Permutations of Vertices for Canonical Form Detection in Graph Mining
by: Andrés Gago-Alonso
Published: (2015-10-01)

A constraint programming approach to subgraph isomorphism
by: Zampelli, Stéphane
Published: (2008)

Low complexity Breadth First Search Sphere Detector for MIMO Systems
by: Shirly Edward.A, et al.
Published: (2015-12-01)

MapEff: An Effective Graph Isomorphism Agorithm Based on the Discrete-Time Quantum Walk
by: Kai Liu, et al.
Published: (2019-06-01)

Marking Vertices to Find Graph Isomorphism Mapping Based on Continuous-Time Quantum Walk
by: Xin Wang, et al.
Published: (2018-08-01)

Complement and Isomorphism on Bipolar Fuzzy Graphs
by: Ali Asghar Talebi, et al.
Published: (2014-12-01)

Implementasi Metode Breadth First Search danVikor pada Aplikasi Diagnosa Kerusakan Hardware Komputer
by: Halim Agung, et al.
Published: (2016-09-01)

QAPV: a polynomial invariant for graph isomorphism testing
by: Valdir Agustinho de Melo, et al.
Published: (2013-08-01)

Connected domination in graphs
by: Mahalingam, Gayathri
Published: (2005)

Constructing Independent Spanning Trees on Generalized Recursive Circulant Graphs
by: Dun-Wei Cheng, et al.
Published: (2021-01-01)

On the shortest path and minimum spanning tree problems
by: Pettie, Seth
Published: (2008)

The Correlation of Isomorphic, Open-Ended, and Conventional Score on the Ability to Solve Kinematics Graph Questions
by: Tomy Suganda, et al.
Published: (2020-12-01)

Parallel Algorithm for Solving the Graph Isomorphism Problem
by: Vladimir Vasilyevich Vasilchikov
Published: (2020-03-01)

The Color Number of Cubic Graphs Having a Spanning Tree with a Bounded Number of Leaves
by: Analen Malnegro, et al.
Published: (2021-07-01)

An investigation into graph isomorphism based zero-knowledge proofs.
by: Ayeh, Eric
Published: (2009)

The search for minimal edge 1-extension of an undirected colored graph
by: Razumovsky, Peter Vladimirovich
Published: (2021-08-01)

Applications of a Novel Sampling Technique to Fully Dynamic Graph Algorithms
by: Mountjoy, Benjamin
Published: (2013)

Cannot write session to /tmp/vufind_sessions/sess_tm8baph7so8g09ese77fel36se