Pages that link to "Item:Q1170207"
From MaRDI portal
The following pages link to A simple algorithm to detect balance in signed graphs (Q1170207):
Displayed 12 items.
- How colorful the signed graph? (Q759762) (← links)
- Applications of edge coverings by cliques (Q762498) (← 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)
- On the problem of consistent marking of a graph (Q1805325) (← links)
- Characterizations of consistent marked graphs (Q1874545) (← links)
- Inverting Signed Graphs (Q3703931) (← links)
- Further Algebraic Results in the Theory of Balance (Q4799469) (← links)
- A Dynamic Programming Algorithm To Test A Signed Graph For Balance (Q4807702) (← links)