Pages that link to "Item:Q2039689"
From MaRDI portal
The following pages link to Approximation algorithms for balancing signed graphs (Q2039689):
Displaying 12 items.
- Separator-based data reduction for signed graph balancing (Q613659) (← links)
- A characterization of signed hypergraphs and its applications to VLSI via minimization and logic synthesis (Q1276973) (← links)
- Optimizing transformations of structural balance in signed networks with potential relationships (Q1620110) (← links)
- Evaluating balancing on social networks through the efficient solution of correlation clustering problems (Q1688940) (← links)
- Fast computing global structural balance in signed networks based on memetic algorithm (Q1783166) (← links)
- On optimization of complete social networks (Q2003111) (← links)
- Embedding signed graphs in the line (Q2253962) (← 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)
- (Q3773910) (← links)
- A Combinatorial Approximation Algorithm for Graph Balancing with Light Hyper Edges (Q4606320) (← links)
- A matheuristic approach for the maximum balanced subgraph of a signed graph (Q5034728) (← links)
