Graph edit distance from spectral seriation

Robles-Kelly, Antonio and Hancock, Edwin R 2005, Graph edit distance from spectral seriation, IEEE transactions on pattern analysis and machine intelligence, vol. 27, no. 3, pp. 365-378, doi: 10.1109/TPAMI.2005.56.

Attached Files
Name Description MIMEType Size Downloads

Title Graph edit distance from spectral seriation
Author(s) Robles-Kelly, AntonioORCID iD for Robles-Kelly, Antonio
Hancock, Edwin R
Journal name IEEE transactions on pattern analysis and machine intelligence
Volume number 27
Issue number 3
Start page 365
End page 378
Total pages 14
Publisher Institute of Electrical and Electronics Engineers
Place of publication Piscataway, N.J.
Publication date 2005-03
ISSN 0162-8828
Keyword(s) Graph edit distance
Graph seriation
Maximum a posteriori probability (MAP)
Graph-spectral methods
Science & Technology
Computer Science, Artificial Intelligence
Engineering, Electrical & Electronic
Computer Science
Language eng
DOI 10.1109/TPAMI.2005.56
Indigenous content off
Field of Research 0801 Artificial Intelligence and Image Processing
0806 Information Systems
0906 Electrical and Electronic Engineering
HERDC Research category C1.1 Refereed article in a scholarly journal
Copyright notice ©2005, IEEE
Persistent URL

Connect to link resolver
Unless expressly stated otherwise, the copyright for items in DRO is owned by the author, with all rights reserved.

Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 122 times in TR Web of Science
Scopus Citation Count Cited 0 times in Scopus
Google Scholar Search Google Scholar
Access Statistics: 102 Abstract Views, 0 File Downloads  -  Detailed Statistics
Created: Thu, 18 Jul 2019, 12:06:06 EST

Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO. If you believe that your rights have been infringed by this repository, please contact