Ullman (Subgraph Isomorphism Graph Isomorphism Problem)

From Algorithm Wiki

Revision as of 11:16, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == == Space Complexity == () == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 1976 == Reference == https://dl.acm.org/doi/10.1145/321921.321925")

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

Time Complexity

Space Complexity

()

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Year

1976

Reference

https://dl.acm.org/doi/10.1145/321921.321925

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Ullman_(Subgraph_Isomorphism_Graph_Isomorphism_Problem)&oldid=45469"