Abstract
We consider the problem of producing interference-minimal graphs with additional properties such as connectivity, bounded stretch factor or bounded link diameter. We compute exact interference-minimal graphs and estimated interference-minimal graphs. The latter can be computed faster.
Original language | English |
---|---|
Title of host publication | Abstracts 21th European Workshop on Computational Geometry (EWCG 2005, Eindhoven, The Netherlands, March 9-11, 2005) |
Editors | M.T. Berg, de |
Place of Publication | Eindhoven |
Publisher | Technische Universiteit Eindhoven |
Pages | 203-206 |
Publication status | Published - 2005 |