|
|||||
|
|
A simple algorithm to detect balance in signed graphs |
|
| Authors: | Frank Harary Jerald A. Kabell |
| Affiliation: | Institute for Social Research, University of Michigan, Ann Arbor, MI, U.S.A. |
| Abstract: | We develop a natural correspondence between marked graphs and balanced signed graphs, and exploit it to obtain a simple linear time algorithm by which any signed graph may be tested for balance. |
| Keywords: | Signed graph Algorithm Balance spanning tree Marked graph |
| 本文献已被 ScienceDirect 等数据库收录！ | |