On best transitive approximations to simple graphs

DOI10.1007/s00236-004-0144-0zbMath1086.68100OpenAlexW2037306276MaRDI QIDQ1762840

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)

Related Items (3)

A new temporal interpretation of cluster editing ⋮ Cluster Editing ⋮ Closer

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