A partial ordering for relational graphs applicable to varying levels of detail

DOI10.1016/0167-8655(90)90039-5zbMath0941.68717OpenAlexW2084825047MaRDI QIDQ4310542

Richard E. Blake

Publication date: 1 August 2000

Published in: Pattern Recognition Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-8655(90)90039-5

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10)

Related Items (1)

Partitioning graph matching with constraints

This page was built for publication: A partial ordering for relational graphs applicable to varying levels of detail