On best transitive approximations to simple graphs

DOI10.1007/S00236-004-0144-0zbMATH Open1086.68100OpenAlexW2037306276MaRDI QIDQ1762840FDOQ1762840

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

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

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)

Cited In (5)

• Title not available (Why is that?)
• A new temporal interpretation of cluster editing
• Cluster editing
• A new temporal interpretation of cluster editing
• Closer

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)