A graph is locally irregular if every two adjacent vertices have distinct degrees. Recently, Baudon et al. introduced the notion of decomposition into locally irregular subgraphs. They conjectured that for almost every graphG, there exists a minimum integer χirr(G) such thatG admits an edge-partition into χ ′ irr(G) classes, each of which induces a locally irregular graph. In particular, they c...

Most data-parallel languages use arrays to support paral-lelism. This regular data structure allows a natural development of regular parallel algorithms. The implementation of irregular algorithms requires a programming eeort to project the irregular data structures onto regular structures. We rst propose in this paper a classiication of existing data-parallel languages. We brieey describe thei...