A Generic Graph Distance Measure Based on Multivalent Matchings

Sorlin, Sébastien; Solnon, Christine; Jolion, Jean-Michel

doi:10.1007/978-3-540-68020-8_6

Sébastien Sorlin,
Christine Solnon &
Jean-Michel Jolion

Part of the book series: Studies in Computational Intelligence ((SCI,volume 52))

1357 Accesses
6 Citations

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Authors

Sébastien Sorlin
View author publications
You can also search for this author in PubMed Google Scholar
Christine Solnon
View author publications
You can also search for this author in PubMed Google Scholar
Jean-Michel Jolion
View author publications
You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

Computer Science & Engineering Department, University of South Florida, 4202 E. Fowler Ave., ENB 118, 33620, Tampa, FL, USA
Abraham Kandel
Institute of Computer Science and Applied Mathematics (IAM), Neubrückstrasse 10, CH-3012, Bern, Switzerland
Horst Bunke
Department of Information Systems Engineering, Ben-Gurion University of the Negev, 84105, Beer-Sheva, Israel
Mark Last

Rights and permissions

Reprints and permissions

Copyright information

About this chapter

Cite this chapter

Sorlin, S., Solnon, C., Jolion, JM. (2007). A Generic Graph Distance Measure Based on Multivalent Matchings. In: Kandel, A., Bunke, H., Last, M. (eds) Applied Graph Theory in Computer Vision and Pattern Recognition. Studies in Computational Intelligence, vol 52. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-68020-8_6

Download citation

DOI: https://doi.org/10.1007/978-3-540-68020-8_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-68019-2
Online ISBN: 978-3-540-68020-8
eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics