Efficient graph automorphism by vertex partitioning
From MaRDI portal
Publication:1836990
DOI10.1016/S0004-3702(83)80012-5zbMath0506.68053OpenAlexW1990061389MaRDI QIDQ1836990
Glenn Fowler, F. Gail Gray, Charles Feustel, Robert M. Haralick, Charles M. Grinstead
Publication date: 1983
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0004-3702(83)80012-5
Related Items (2)
Solving subgraph isomorphism problems with constraint programming ⋮ Expressions on a fuzzy pretopological substratum
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On construction and identification of graphs. With contributions by A. Lehman, G. M. Adelson-Velsky, V. Arlazarov, I. Faragev, A. Uskov, I. Zuev, M. Rosenfeld and B. Weisfeiler
- Graph isomorphism: A heuristic edge-partitioning-oriented algorithm
- Further annotated bibliography on the isomorphism disease
- The Consistent Labeling Problem: Part I
- Graph Optimal Monomorphism Algorithms
- The Consistent Labeling Problem: Part II
- Refined Vertex Codes and Vertex Partitioning Methodology for Graph Isomorphism Testing
- Optimum Featurs and Graph Isomorphism
- Backtrack programming techniques
- An Algorithm for Subgraph Isomorphism
- On the Computational Complexity of Combinatorial Problems
- A Fast Backtracking Algorithm to Test Directed Graphs for Isomorphism Using Distance Matrices
- The Indirect Binary n-Cube Microprocessor Array
- The graph isomorphism disease
- On Ordering and Identifying Undirected Linear Graphs
- Generalized Matrix Functions and the Graph Isomorphism Problem
- An Efficient Algorithm for Graph Isomorphism
- GIT—a heuristic program for testing pairs of directed line graphs for isomorphism
This page was built for publication: Efficient graph automorphism by vertex partitioning
