Hardness of approximating graph transformation problem

DOI10.1007/3-540-58325-4_168MaRDI QIDQ4525686zbMATH OpenFDO

Authors Chih-Long Lin

Publication date 24 January 2001

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-58325-4_168

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Cited in

(4)

• Detecting almost symmetries of graphs
• A linear-time algorithm and analysis of graph relative Hausdorff distance
• On the Complexity of Local Graph Transformations
• Hypergraph co-optimal transport: metric and categorical properties

This page was built for publication: Hardness of approximating graph transformation problem

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