Structural Graph Matching With Polynomial Bounds On Memory and on Worst-Case Effort

Fred W. DePiero. Structural Graph Matching With Polynomial Bounds On Memory and on Worst-Case Effort. In ICPR (4). pages 379-382, 2004. [doi]

Authors

Fred W. DePiero

This author has not been identified. Look up 'Fred W. DePiero' in Google