A study on k-walk generation algorithm to prevent the tottering in graph edit distance heuristic algorithms

Graph edit distance is usually used for graph similarity checking due to its low information loss and flexibility advantages. However, graph edit distance can’t be used efficiently because it is an NP-Hard problem. Many graph edit distance heuristic algorithms have been proposed to solve this proble...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of combinatorial optimization Vol. 49; no. 1; p. 9
Main Authors:	Yoon, SeongCheol, Seo, Daehee, Kim, Su-Hyun, Lee, Im-Yeong
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.01.2025 Springer Nature B.V
Subjects:	Algorithms Approximation Combinatorics Convex and Discrete Geometry Graphs Heuristic Heuristic methods Mathematical Modeling and Industrial Mathematics Mathematics Mathematics and Statistics Nodes Operations Research/Decision Theory Optimization Theory of Computation Tottering Graph Heuristic algorithm -
ISSN:	1382-6905, 1573-2886
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!