Edit distance measure for graphs

Tomasz Dzido , Krzysztof Krzywdziński

Abstract

n/a
Author Tomasz Dzido (FMPI / II)
Tomasz Dzido,,
- Institute of Informatics
, Krzysztof Krzywdziński
Krzysztof Krzywdziński,,
-
Journal seriesCzechoslovak Mathematical Journal, ISSN 0011-4642, (A 15 pkt)
Issue year2015
Vol65
No3
Pages829-836
Keywords in Englishextremal graph problem, similarity of graphs
ASJC Classification2600 General Mathematics
DOIDOI:10.1007/s10587-015-0211-4
URL http://link.springer.com/article/10.1007/s10587-015-0211-4
Languageen angielski
Score (nominal)15
Score sourcejournalList
ScoreMinisterial score = 15.0, 10-12-2019, ArticleFromJournal
Ministerial score (2013-2016) = 15.0, 10-12-2019, ArticleFromJournal
Publication indicators WoS Citations = 0; Scopus SNIP (Source Normalised Impact per Paper): 2015 = 0.557; WoS Impact Factor: 2015 = 0.284 (2) - 2015=0.377 (5)
Citation count*
Cite
Share Share

Get link to the record


* presented citation count is obtained through Internet information analysis and it is close to the number calculated by the Publish or Perish system.
Back
Confirmation
Are you sure?