A new algorithm for digraph isomorphism

DOI10.1007/BF01932396MaRDI QIDQ4136562zbMATHOpenAlexFDO

Authors

Publication date 1977

Published in BIT (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01932396

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99)

Cites work

• scientific article; zbMATH DE number 3679848 (Why is no real title available?)
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• scientific article; zbMATH DE number 3446921 (Why is no real title available?)
• A Backtrack Procedure for Isomorphism of Directed Graphs
• An Algorithm for Subgraph Isomorphism
• An Efficient Algorithm for Graph Isomorphism
• Cospectral Graphs and Digraphs
• Depth-First Search and Linear Graph Algorithms
• GIT—a heuristic program for testing pairs of directed line graphs for isomorphism
• Graph isomorphism: A heuristic edge-partitioning-oriented algorithm
• Search for a unique incidence matrix of a graph

Cited in

(4)

• Graph isomorphism problem
• Algorithms for finding directed graph isomorphisms by finite automata
• A fast backtrack algorithm for graph isomorphism
• Linear stationary control systems over a Boolean semiring: geometric properties and the isomorphism problem

Describes a project that uses

Uses Software

• Algorithm 447

This page was built for publication: A new algorithm for digraph isomorphism

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4136562)