Balancing a complete signed graph by editing edges and deleting nodes
碩士 === 國立中正大學 === 資訊工程研究所 === 101 === A signed graph is a simple undirected graph in which each edge is either positive or negative. A signed graph is balanced if every cycle has even numbers of negative edges. In this thesis we study the problem of balancing a complete signed graph by minimum editi...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2013
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/61999712982323093716 |