A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
As graphs become bigger, the need to efficiently partition them becomes more pressing. Most graph partitioning algorithms subdivide the vertex set into partitions of similar size, trying to keep the number of cut edges as small as possible. An alternative approach divides the edge set, with the goal of obtaining more balanced partitions in presence of high-degree nodes, such as hubs in real world networks, that can be split between distinct partitions. We introduce dfep, a distributed edgedoi:10.1007/978-3-662-48096-0_27 fatcat:qmcelraajvdrzeg5qda663fjdy