Algorithms for optimally shifting intervals under intersection graph models

DOI10.1007/978-981-97-7752-5_5MaRDI QIDQ6989701zbMATH OpenFDO

Authors Nicolás Honorato-Droguett, Kazuhiro Kurita, Tesshu Hanaka, Hirotaka Ono

Publication date 29 April 2025

Full work available at URL https://doi.org/10.1007/978-981-97-7752-5_5

zbMATH Keywords

graph edit distanceintersection graphsoptimisation

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• A distance measure between attributed relational graphs for pattern recognition
• A survey of graph edit distance
• Extending the fundamental theorem of linear programming for strict inequalities
• Graph theory
• Graphs, networks and algorithms.
• scientific article; zbMATH DE number 2107836 (Why is no real title available?)
• scientific article; zbMATH DE number 7740872 (Why is no real title available?)
• Introduction to algorithms.
• On representatives of subsets.
• Structural pattern recognition with graph edit distance. Approximation algorithms and applications
• Systems of distant representatives
• Systems of distant representatives in Euclidean space

Cited in

(1)

• On the complexity of minimising the moving distance for dispersing objects

This page was built for publication: Algorithms for optimally shifting intervals under intersection graph models

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