A Dynamic Programming Algorithm To Test A Signed Graph For Balance

DOI10.1080/0020716021000009246zbMATH Open1024.05034OpenAlexW2015341785MaRDI QIDQ4807702FDOQ4807702

Authors: 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

Recommendations

• scientific article; zbMATH DE number 1472163
• A Coding Approach to Signed Graphs
• Approximation algorithms for balancing signed graphs
• scientific article; zbMATH DE number 996908
• Balanced decompositions of a signed graph

zbMATH Keywords

balancegraph algorithmsigned graphline index

Mathematics Subject Classification ID

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

Cites Work

• Signed graphs
• On the notion of balance of a signed graph
• Some simplified NP-complete graph problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• A characterization of signed hypergraphs and its applications to VLSI via minimization and logic synthesis
• Edge-Deletion Problems
• Characterizations of signed graphs
• A simple algorithm to detect balance in signed graphs

Cited In (6)

• Algorithms for derivation of structurally stable Hamiltonian signed graphs
• On optimization of complete social networks
• A Coding Approach to Signed Graphs
• Further Algebraic Results in the Theory of Balance
• Approximation algorithms for balancing signed graphs
• Computing the line index of balance using integer programming optimisation

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4807702)