A Dynamic Programming Algorithm To Test A Signed Graph For Balance

References

• Barahona , F. 1982 . On the Computational Complexity of Ising Spin Glass Models . J. Phys. A: Math Gen. , 15 : 3241 – 3253 .
   Google Scholar
• Garey , M. R. , Johnson , D. S. and Stockmeyer , L. J. 1976 . Some Simplified NP-complete Graph Problems . Theoretical Computer Science , 1 : 237 – 267 .
   Google Scholar
• Harary , F. 1969 . Graph Theory , Addison-Wesley .
   Google Scholar
• Harary , F. 1953-1954 . On the Notion of Balance of a Signed Graph . Michigan Mathematical Joumal , 2 : 143 – 146 .
   Google Scholar
• Harary , F. 1959 . On the Measurement of Structural Balance . Behavioral Sci. , 4 : 316 – 323 .
   Google Scholar
• Harary , F. , Norman , R. Z. and Cartwright , D. 1965 . Structural Models: An Introduction to the Theory of Directed Graphs , Wiley .
   Google Scholar
• Harary , F. and Kabell , J. A. 1980 . A Simple Algorithm to Detect Balance in Signed Graphs . Mathematical Social Science , 1 : 131 – 136 .
   Web of Science ®Google Scholar
• Heider , F. 1946 . Attitudes and Cognitive Organization . J. Psych. , 21 : 107 – 112 .
   PubMed Web of Science ®Google Scholar
• Knuth , D. 1973 . Fundamental Algorithms, Vol. I of the Art of Computer Programming , 2nd ed , Reading , MA : AddisonWesley .
   Google Scholar
• Roberts , F. S. 1976 . Discrete Mathematical Models with Applications to Social, Biological, and Environmental Problems , Prentice Hall .
   Google Scholar
• Shi , C. J. and Brzozowski , J. A. 1999 . A Characterization of Signed Hypergraphs and its Applications to VLSI via Minimization and Logic Synthesis . Discrete Applied Mathematics , 90 : 223 – 243 .
   Web of Science ®Google Scholar
• Yannakakis , M. 1981 . Edge Deletion Problems . SIAM Journal on Computing , 10 : 297 – 309 .
   Web of Science ®Google Scholar
• Zaslavsky , T. 1981 . Characterization of Signed Graphs . J. Graph Theory , 5 : 401 – 406 .
   Web of Science ®Google Scholar
• Zaslavsky , T. 1982 . Signed Graphs . Discrete Applied Mathematics , 4 : 47 – 74 .
   Web of Science ®Google Scholar