A signed graph H =( V , E , σ ) consists of a graph G =( V , E ) together with a sign function σ : E M { m , +}. A fundamental concept in both, the theory and applications of signed graphs is that of balance . We present a new dynamic programming algorithm to detect balance in signed graphs which traverses each line of the signed graph at most once. Furthermore the computer implementation of the proposed algorithm requires three linear arrays of length | V | only, and the graph need not be stored in computer's memory. Thus the proposed algorithm is optimal with respect to both time and space complexities: The line index for balance of an unbalanced signed graph is the minimum number of lines needed to be removed to make the signed graph balanced. Barahona has proved that finding the line index for balance of a signed graph is an NP- complete problem. In this paper, we prove a stronger result, namely that the problem remains NP- complete even when restricted to signed graphs having negative signs only.
A Dynamic Programming Algorithm To Test A Signed Graph For Balance
Reprints and Corporate Permissions
Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?
To request a reprint or corporate permissions for this article, please click on the relevant link below:
Academic Permissions
Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?
Obtain permissions instantly via Rightslink by clicking on the button below:
If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.
Related research
People also read lists articles that other readers of this article have read.
Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.
Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.