A new algorithm for digraph isomorphism

DOI10.1007/BF01932396zbMATH Open0362.68076OpenAlexW1973303066MaRDI QIDQ4136562FDOQ4136562

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

• Title not available (Why is that?)
• An Algorithm for Subgraph Isomorphism
• Depth-First Search and Linear Graph Algorithms
• Title not available (Why is that?)
• An Efficient Algorithm for Graph Isomorphism
• Title not available (Why is that?)
• Cospectral Graphs and Digraphs
• Graph isomorphism: A heuristic edge-partitioning-oriented algorithm
• GIT—a heuristic program for testing pairs of directed line graphs for isomorphism
• A Backtrack Procedure for Isomorphism of Directed Graphs
• Search for a unique incidence matrix of a graph

Cited In (4)

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

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)