•  English
    • Persian
    • English
  •   Login
  • Ferdowsi University of Mashhad
  • |
  • Information Center and Central Library
    • Persian
    • English
  • Home
  • Source Types
    • Journal Paper
    • Ebook
    • Conference Paper
    • Standard
    • Protocol
    • Thesis
  • Use Help
View Item 
  •   FUM Digital Library
  • Fum
  • Articles
  • Latin Articles
  • View Item
  •   FUM Digital Library
  • Fum
  • Articles
  • Latin Articles
  • View Item
  • All Fields
  • Title
  • Author
  • Year
  • Publisher
  • Subject
  • Publication Title
  • ISSN
  • DOI
  • ISBN
Advanced Search
JavaScript is disabled for your browser. Some features of this site may not work without it.

A fast projected fixed-point algorithm for large graph matching

Author:
Yao Lu
,
Kaizhu Huang
,
Cheng-Lin Liu
Year
: 2016
DOI: 10.1016/j.patcog.2016.07.015
URI: http://libsearch.um.ac.ir:80/fum/handle/fum/1650598
Collections :
  • Latin Articles
  • Download: (1.555Mb)
  • Show Full MetaData Hide Full MetaData
  • Statistics

    A fast projected fixed-point algorithm for large graph matching

Show full item record

contributor authorYao Lu
contributor authorKaizhu Huang
contributor authorCheng-Lin Liu
date accessioned2020-03-14T12:54:22Z
date available2020-03-14T12:54:22Z
date issued2016
identifier otherDNGy7WQjXhYwSHA4zLV1m4IRcn_3mTC1ecMilCNQvmCY11Ppz4.pdf
identifier urihttp://libsearch.um.ac.ir:80/fum/handle/fum/1650598
formatgeneral
languageEnglish
titleA fast projected fixed-point algorithm for large graph matching
typeJournal Paper
contenttypeFulltext
contenttypeFulltext
identifier padid11866857
identifier doi10.1016/j.patcog.2016.07.015
journal titlePattern Recognition
coverageAcademic
pages971-982
journal volume60
filesize1631067
citations0
  • About Us
نرم افزار کتابخانه دیجیتال "دی اسپیس" فارسی شده توسط یابش برای کتابخانه های ایرانی | تماس با یابش
DSpace software copyright © 2019-2022  DuraSpace