On best transitive approximations to simple graphs

DOI10.1007/S00236-004-0144-0MaRDI QIDQ1762840zbMATH OpenOpenAlexFDO

Authors Steven Delvaux, Leon Horsten

Publication date 11 February 2005

Published in Acta Informatica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00236-004-0144-0

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Inverse problems of transitive closure
• Algorithms for computing the optimal transitive approximation of a proximity relation
• Approximation and hardness results for the maximum edges in transitive closure problem
• Complexité de problèmes liés aux graphes sans circuit
• Approximating Transitive Reductions for Directed Networks

Cited in

(5)

• Cluster editing
• A new temporal interpretation of cluster editing
• scientific article; zbMATH DE number 7564191 (Why is no real title available?)
• Closer
• A new temporal interpretation of cluster editing

This page was built for publication: On best transitive approximations to simple graphs

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