"GIT - a heuristic program for testing pairs of directed line graphs for ..."

Stephen H. Unger (1964)

> Home

Details and statistics

DOI: 10.1145/363872.363899

access: closed

type: Journal Article

metadata version: 2018-11-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/cacm/Unger64
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cacm/Unger64
Stephen H. Unger:
GIT - a heuristic program for testing pairs of directed line graphs for isomorphism. Commun. ACM 7(1): 26-34 (1964)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.