Many of the fundamental coding problems can be represented as graph problems. These problems are often intrinsically difficult and unsolved even if the code length is relatively small. With the ...

Cluster Editing is one form of correlation clustering that requires a minimal amount of edge-editing operations to transform a given graph into a transitive graph or a disjoint union of cliques. This ...