A new algorithm for digraph isomorphism

DOI10.1007/BF01932396zbMath0362.68076OpenAlexW1973303066MaRDI QIDQ4136562

No author found.

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

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

Related Items

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

Uses Software

• Algorithm 447

Cites Work

• Graph isomorphism: A heuristic edge-partitioning-oriented algorithm
• A Backtrack Procedure for Isomorphism of Directed Graphs
• An Algorithm for Subgraph Isomorphism
• Search for a unique incidence matrix of a graph
• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item