A simple algorithm to detect balance in signed graphs
From MaRDI portal
Publication:1170207
DOI10.1016/0165-4896(80)90010-4zbMath0497.05056OpenAlexW1995536165MaRDI QIDQ1170207
Jerald A. Kabell, Frank Harary
Publication date: 1980
Published in: Mathematical Social Sciences (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2027.42/23150
Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Graph theory (05C99)
Related Items (37)
Characterizations of consistent marked graphs ⋮ Inverting Signed Graphs ⋮ A spectral method to incidence balance of oriented hypergraphs and induced signed hypergraphs ⋮ Further Algebraic Results in the Theory of Balance ⋮ A Dynamic Programming Algorithm To Test A Signed Graph For Balance ⋮ Negative (and positive) circles in signed graphs: a problem collection ⋮ A branch-and-cut algorithm for the maximum \(k\)-balanced subgraph of a signed graph ⋮ On balance and consistency preserving 2-path signed graphs ⋮ List homomorphisms to separable signed graphs ⋮ Graph theoretic models ⋮ Social disruption games in signed networks ⋮ Estimating the number of weak balance structures in signed networks ⋮ Curvature and Higher Order Buser Inequalities for the Graph Connection Laplacian ⋮ Extracting pure network submatrices in linear programs using signed graphs. ⋮ Homomorphisms of signed graphs: an update ⋮ Concepts of signed graph coloring ⋮ Frustration and isoperimetric inequalities for signed graphs ⋮ Embedding signed graphs in the line ⋮ Harary's theorem on signed graphs and reversibility of Markov chains ⋮ Signed \(k\)-uniform hypergraphs and tensors ⋮ Unnamed Item ⋮ Cheeger constants, structural balance, and spectral clustering analysis for signed graphs ⋮ Algebraic topological characterizations of structural balance in signed graphs ⋮ Characterization of signed graphs whose iterated signed line graphs are balanced or \(S\)-consistent ⋮ Spectral aspects of symmetric matrix signings ⋮ On the problem of consistent marking of a graph ⋮ Can Everybody Sit Closer to Their Friends Than Their Enemies? ⋮ How colorful the signed graph? ⋮ Applications of edge coverings by cliques ⋮ Fixed-Parameter Algorithms in Analysis of Heuristics for Extracting Networks in Linear Programs ⋮ Spectral aspects of symmetric matrix signings ⋮ The line index and minimum cut of weighted graphs ⋮ Signsolvability revisited ⋮ An algorithm for identifying Morishima and anti-Morishima matrices and balanced digraphs ⋮ List homomorphism problems for signed trees ⋮ Algebraic criteria for structure identification and behaviour analysis of signed networks ⋮ The maximum balanced subgraph of a signed graph: applications and solution approaches
Cites Work
This page was built for publication: A simple algorithm to detect balance in signed graphs
