An Algorithm for Subgraph Isomorphism.

Ullmann, J. R. (1976). An Algorithm for Subgraph Isomorphism. Journal of the ACM, 31-42.

Type

Journal article

Intellectual base

Primary research

Year

1976

Pages

31-42

DOI

10.1145/321921.321925

DOI registrant

Association for Computing Machinery

Link

https://doi.org/10.1145/321921.321925

Cited by

2 citations across 2 artifacts.

Domain-specific

• Subgraph Isomorphism Problem
  • Ullmann's 1976 algorithm established the classic backtracking-and-refinement approach, using inference to eliminate impossible assignments during tree search.
• Substructure Search
  • Not generic subgraph isomorphism alone. Ullmann's algorithm addresses graphs generally.

Verification

Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.

Does it back the claim? Not recorded. Neither this nor any other of the 2 citations of this work carries a recorded support check.

Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.

See how references were verified.

Registry ID ref:14fd2363fb7f · see in the full table