A Dynamic Programming Algorithm To Test A Signed Graph For Balance

DOI10.1080/0020716021000009246zbMath1024.05034OpenAlexW2015341785MaRDI QIDQ4807702

Emmanuel Loukakis

Publication date: 10 November 2003

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/0020716021000009246

zbMATH Keywords

graph algorithmsigned graphbalanceline index

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Dynamic programming (90C39) Graph algorithms (graph-theoretic aspects) (05C85) Signed and weighted graphs (05C22)

Related Items (2)

Algorithms for derivation of structurally stable Hamiltonian signed graphs ⋮ On optimization of complete social networks

Cites Work

• Unnamed Item
• Unnamed Item
• Signed graphs
• A simple algorithm to detect balance in signed graphs
• Some simplified NP-complete graph problems
• A characterization of signed hypergraphs and its applications to VLSI via minimization and logic synthesis
• On the notion of balance of a signed graph
• Edge-Deletion Problems
• Characterizations of signed graphs

This page was built for publication: A Dynamic Programming Algorithm To Test A Signed Graph For Balance