Graph matching (Space Syntax)

From Design Computation
Revision as of 21:03, 17 January 2020 by Abel Maciel (talk | contribs) (→‎Recommended Reading)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search

Graph matching aims to detect how similar any pair of small, labelled, directed graphs are. It achieves this by calculating how many operations are needed to fully transform one graph into another.

Cross-References

Recommended Reading

Space Syntax Glossary

Conroy-Dalton R and Kirsan C. (2008). Small graph matching and building genotypes. Environment and Planning B: Planning and Design, 35 (5): 810-830.

Retrieved from "http://wiki.designcomputation.org/home/index.php?title=Graph_matching_(Space_Syntax)&oldid=24231"