Pages that link to "Item:Q1170207"
From MaRDI portal
The following pages link to A simple algorithm to detect balance in signed graphs (Q1170207):
Displaying 36 items.
- Frustration and isoperimetric inequalities for signed graphs (Q516822) (← links)
- Characterization of signed graphs whose iterated signed line graphs are balanced or \(S\)-consistent (Q726520) (← links)
- How colorful the signed graph? (Q759762) (← links)
- Applications of edge coverings by cliques (Q762498) (← links)
- Spectral aspects of symmetric matrix signings (Q783041) (← links)
- Signsolvability revisited (Q795898) (← links)
- An algorithm for identifying Morishima and anti-Morishima matrices and balanced digraphs (Q1059646) (← links)
- Graph theoretic models (Q1148340) (← links)
- The line index and minimum cut of weighted graphs (Q1303736) (← links)
- Extracting pure network submatrices in linear programs using signed graphs. (Q1427813) (← links)
- Negative (and positive) circles in signed graphs: a problem collection (Q1643910) (← links)
- On the problem of consistent marking of a graph (Q1805325) (← links)
- Characterizations of consistent marked graphs (Q1874545) (← links)
- List homomorphism problems for signed trees (Q2111917) (← links)
- Estimating the number of weak balance structures in signed networks (Q2207900) (← links)
- Homomorphisms of signed graphs: an update (Q2225427) (← links)
- Concepts of signed graph coloring (Q2225432) (← links)
- Embedding signed graphs in the line (Q2253962) (← links)
- Harary's theorem on signed graphs and reversibility of Markov chains (Q2255510) (← links)
- Signed \(k\)-uniform hypergraphs and tensors (Q2273831) (← links)
- Cheeger constants, structural balance, and spectral clustering analysis for signed graphs (Q2279269) (← links)
- Algebraic topological characterizations of structural balance in signed graphs (Q2280808) (← links)
- The maximum balanced subgraph of a signed graph: applications and solution approaches (Q2356257) (← links)
- A branch-and-cut algorithm for the maximum \(k\)-balanced subgraph of a signed graph (Q2414463) (← links)
- Can Everybody Sit Closer to Their Friends Than Their Enemies? (Q3088056) (← links)
- Fixed-Parameter Algorithms in Analysis of Heuristics for Extracting Networks in Linear Programs (Q3656864) (← links)
- Inverting Signed Graphs (Q3703931) (← links)
- Curvature and Higher Order Buser Inequalities for the Graph Connection Laplacian (Q4619480) (← links)
- Further Algebraic Results in the Theory of Balance (Q4799469) (← links)
- A Dynamic Programming Algorithm To Test A Signed Graph For Balance (Q4807702) (← links)
- Algebraic criteria for structure identification and behaviour analysis of signed networks (Q5026852) (← links)
- (Q5089181) (← links)
- Spectral aspects of symmetric matrix signings (Q5092445) (← links)
- A spectral method to incidence balance of oriented hypergraphs and induced signed hypergraphs (Q5887711) (← links)
- On balance and consistency preserving 2-path signed graphs (Q6090315) (← links)
- Social disruption games in signed networks (Q6199710) (← links)
