On best transitive approximations to simple graphs
On best transitive approximations to simple graphs
复制标题
关于简单图的最佳传递近似
作者：
S. Delvaux;L. Horsten
摘要：在本文中，我们研究了简单图的最佳传递逼近问题的组合性和复杂性。这些问题是以一种相互关联的方式解决的。我们提供了新的和简单的证明已知的结果，并证明了一些新的定理。
Abstract.In this paper, we investigate both combinatorial and complexity aspects of the problem of finding best transitive approximations to simple graphs. These problems are addressed in an interlocked way. We provide new and simple proofs of known results and in addition prove some new theorems.