Bibliography of distributed approximation on structurally sparse graph classes
share
This document is an informal bibliography of the papers dealing with distributed approximation algorithms on graphs classes that are sparse, but not in the classic setting of bounded degree. We call these classes structurally sparse which means that they are sparse because of their geometric nature (planar, bounded genus and unit-disk graphs) and/or because they have bounded parameters (arboricity, expansion, growth, independence) or forbidden structures (forbidden minors).
READ FULL TEXT