论文信息 - Pseudo-Boolean remarks on balanced graphs

Pseudo-Boolean remarks on balanced graphs

Pseudo-Boolean methods are proposed for (1) recognizing whether a given signed graph is balanced, and (2) for constructing that (those) balanced graph(s), which are the “closest” to a given signed graph.

Peter L. Hammer

[1] Peter L. Hammer,et al. On the Maximization of a Pseudo-Boolean Function , 1972, JACM.

[2] Peter L. Hammer,et al. Boolean Methods in Operations Research and Related Areas , 1968 .

[3] Norman,et al. Structural Models: An Introduction to the Theory of Directed Graphs. , 1966 .