Algorithms for the Maximum Balanced Subgraph Problem
碩士 === 國立中正大學 === 資訊工程研究所 === 100 === Let G=(V,E) be an undirected signed graph whose edge is marked a sign: either positive sign '+' or negative sign '-'. A signed graph is balanced if every cycle has even number of negative edges. In this paper, we study the maximum balanced su...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2012
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/42727337595532315985 |