Efficient graph automorphism by vertex partitioning
type: Item
instance of: scholarly article
title: Efficient graph automorphism by vertex partitioning
zbMATH Open document ID: 0506.68053
DOI: 10.1016/S0004-3702(83)80012-5
author: Glenn Fowler
author: F. Gail Gray
author: Charles Feustel
author: Robert Haralick
author: Charles M. Grinstead
published in: Artificial Intelligence
publication date: 1983-01-01T00:00:00Z
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 3799030
zbMATH Keywords: squeeze tree search
zbMATH Keywords: automorphism partition
MaRDI profile type: Publication
cites work: Refined Vertex Codes and Vertex Partitioning Methodology for Graph Isomorphism Testing
cites work: Backtrack programming techniques
cites work: An Efficient Algorithm for Graph Isomorphism
cites work: Further annotated bibliography on the isomorphism disease
cites work: Graph Optimal Monomorphism Algorithms
cites work: The Consistent Labeling Problem: Part I
cites work: The Consistent Labeling Problem: Part II
cites work: Q4142699
cites work: On the Computational Complexity of Combinatorial Problems
cites work: Q4134015
cites work: Graph isomorphism: A heuristic edge-partitioning-oriented algorithm
cites work: Q3863914
cites work: On Ordering and Identifying Undirected Linear Graphs
cites work: The Indirect Binary n-Cube Microprocessor Array
cites work: The graph isomorphism disease
cites work: A Fast Backtracking Algorithm to Test Directed Graphs for Isomorphism Using Distance Matrices
cites work: Optimum Featurs and Graph Isomorphism
cites work: Generalized Matrix Functions and the Graph Isomorphism Problem
cites work: Q5636908
cites work: Q4076726
cites work: An Algorithm for Subgraph Isomorphism
cites work: GIT—a heuristic program for testing pairs of directed line graphs for isomorphism
cites work: 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
cites work: Q5675663
full work available at URL: s0004-3702(83)80012-5
OpenAlex ID: W1990061389
description: scientific article; zbMATH DE number 3799030