Algorithms for Finding Large Balanced Sets on a Complete Signed Graph
碩士 === 國立中正大學 === 資訊工程研究所 === 100 === A signed graph is a simple graph in which each edge is labeled by a sign either + or -. A signed graph is balanced if every cycle has even numbers of negative edges. In this thesis, we study the problem how to find a maximum vertex subset of a complete signed gr...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2012
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/29096726339224929137 |