文献
J-GLOBAL ID:201802276782441024
整理番号:18A0384892
Hausdorffマッチングと欲張り割当を組み合わせたグラフ編集距離の改良された二次時間近似【Powered by NICT】
Improved quadratic time approximation of graph edit distance by combining Hausdorff matching and greedy assignment
著者 (5件):
Fischer Andreas
(Department of Informatics, University of Fribourg, Boulevard de Perolles 90, Fribourg 1700, Switzerland)
,
Fischer Andreas
(Institute of Complex Systems, University of Applied Sciences and Arts Western Switzerland, Boulevard de Perolles 80, Fribourg 1700, Switzerland)
,
Riesen Kaspar
(Institute for Information Systems, University of Applied Sciences and Arts Northwestern Switzerland, Riggenbachstrasse 16, Olten 4600, Switzerland)
,
Riesen Kaspar
(Institute of Computer Science and Applied Mathematics, University of Bern, Neubrueckstrasse 10, Bern 3012, Switzerland)
,
Bunke Horst
(Institute of Computer Science and Applied Mathematics, University of Bern, Neubrueckstrasse 10, Bern 3012, Switzerland)
資料名:
Pattern Recognition Letters
(Pattern Recognition Letters)
巻:
87
ページ:
55-62
発行年:
2017年
JST資料番号:
H0913A
ISSN:
0167-8655
資料種別:
逐次刊行物 (A)
記事区分:
原著論文
発行国:
オランダ (NLD)
言語:
英語 (EN)