A Correction to the Heuristic Algorithm MinimalFlipSet to Balance Unbalanced Graphs
摘要
We present here a critical correction of the heuristic algorithm MinimalFlipSet in [8] for the NP-hard problem of finding a minimum size subset of edges in an unbalanced signed graph G whose ‘+’/‘ \(-\) ’edge-labels can be flipped to balance G.