Graph edit distance -- optimal and suboptimal algorithms with applications

MaRDI QIDQ2906538zbMATH OpenFDO

Authors Kaspar Riesen, Horst Bunke

Publication date 5 September 2012

zbMATH Keywords

computation of GEDexperimental evaluationgraph edit distance

Mathematics Subject Classification ID

Distance in graphs (05C12) Data structures (68P05) Graph theory (including graph drawing) in computer science (68R10)

Cited in

(3)

• Interactive graph-matching using active query strategies
• Covering tree with stars
• Structure- and function-aware substitution matrices via learnable graph matching

This page was built for publication: Graph edit distance -- optimal and suboptimal algorithms with applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2906538)