THE CHARACTERIZATION OF BINARY RELATION HOMOMORPHISMS

DOI10.1080/03081077808960668zbMath0366.04004OpenAlexW2161624956MaRDI QIDQ4140993

Robert M. 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

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

Related Items (1)

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

Cites Work

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

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