THE CHARACTERIZATION OF BINARY RELATION HOMOMORPHISMS

DOI10.1080/03081077808960668zbMATH Open0366.04004OpenAlexW2161624956MaRDI QIDQ4140993FDOQ4140993

Authors: Robert Haralick 

Publication date: 1978

Published in: International Journal of General Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03081077808960668

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graph theory (05C99) Other classical set theory (including functions, relations, and set algebra) (03E20)

Cites Work

• An Algorithm for Subgraph Isomorphism
• An Efficient Algorithm for Graph Isomorphism
• GIT—a heuristic program for testing pairs of directed line graphs for isomorphism
• A Backtrack Procedure for Isomorphism of Directed Graphs

Cited In (1)

• Relational consistency algorithms and their application in finding subgraph and graph isomorphisms

This page was built for publication: THE CHARACTERIZATION OF BINARY RELATION HOMOMORPHISMS

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