A modeling and computational study of the frustration index in signed networks (Q6068535): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: O(√log n) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedral combinatorics of the \(K\)-partitioning problem with representative variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the line index of balance using integer programming optimisation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Measuring partial balance in signed networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The multi-multiway cut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Correlation clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient solutions for special zero-one programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Local-Search 2-Approximation for 2-Correlation-Clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact ground states of Ising spin glasses: new experimental results with a branch-and-cut algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Correlation clustering in general weighted graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the bipartite edge frustration of fullerene graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum balanced subgraph of a signed graph: applications and solution approaches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separate, Measure and Conquer: Faster Polynomial-Space Algorithms for Max 2-CSP and Counting Dominating Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Correlation clustering with a fixed number of clusters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weakly bipartite graphs and the max-cut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Signed graphs for portfolio analysis in risk management / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separator-based data reduction for signed graph balancing / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the power of unique 2-prover 1-round games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal 2-constraint satisfaction via sum-product algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Powers of tensors and fast matrix multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evaluating balancing on social networks through the efficient solution of correlation clustering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Frustration and isoperimetric inequalities for signed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A derivation of a measure of relative balance for social structures and a characterization of extensive ratio systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-programming design and analysis of fast algorithms for Max 2-CSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Spectral Algorithm for Computing Social Balance / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new algorithm for optimal 2-constraint satisfaction and its implications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-Deletion Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balanced decompositions of a signed graph / rank
 
Normal rank

Revision as of 13:09, 3 August 2024

scientific article; zbMATH DE number 7764304
Language Label Description Also known as
English
A modeling and computational study of the frustration index in signed networks
scientific article; zbMATH DE number 7764304

    Statements

    A modeling and computational study of the frustration index in signed networks (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    13 November 2023
    0 references
    0-1 integer linear programming
    0 references
    balance theory
    0 references
    binary programming
    0 references
    frustration index
    0 references
    line index of balance
    0 references
    optimization
    0 references
    signed graph
    0 references
    signed networks
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references