An eigendecomposition approach to weighted graph matching problems

Umeyama, S

doi:10.1109/34.6778

Record: found
Abstract: not found
Article: not found

An eigendecomposition approach to weighted graph matching problems

Author(s): S. Umeyama

Publication date (Print): Sept. 1988

Journal: IEEE Transactions on Pattern Analysis and Machine Intelligence

Publisher: Institute of Electrical and Electronics Engineers (IEEE)

Read this article at

ScienceOpenPublisher

Bookmark

There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

Related collections

Author and article information

Journal

Title: IEEE Transactions on Pattern Analysis and Machine Intelligence

Abbreviated Title: IEEE Trans. Pattern Anal. Machine Intell.

Publisher: Institute of Electrical and Electronics Engineers (IEEE)

ISSN (Print): 01628828

Publication date (Print): Sept. 1988

Volume: 10

Issue: 5

Pages: 695-703

Article

DOI: 10.1109/34.6778

SO-VID: 54a20da9-6b58-43bf-b520-ecaaa48d3031

History

Data availability:

An eigendecomposition approach to weighted graph matching problems

Read this article at

Related collections

Exponential Random Graph Models

Author and article information

Journal

Article

History

Comments

Comment on this article

Similar content 2,427

Cited by 101