Optimal Edge Deletions for Signed Graph Balancing

DOI10.1007/978-3-540-72845-0_23MaRDI QIDQ5432322zbMATH OpenOpenAlexFDO

Authors Falk Hüffner, Nadja Betzler, Rolf Niedermeier

Publication date 2 January 2008

Published in Experimental Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-72845-0_23

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Separator-based data reduction for signed graph balancing
• scientific article; zbMATH DE number 1472163
• Approximation algorithms for balancing signed graphs
• Maximum balanced subgraph problem parameterized above lower bound
• Maximum balanced subgraph problem parameterized above lower bound

Cited in

(13)

• Attractors in coherent systems of differential equations
• Approximation algorithms for balancing signed graphs
• The maximum balanced subgraph of a signed graph: applications and solution approaches
• Iterative Compression for Exactly Solving NP-Hard Minimization Problems
• A faster fixed-parameter approach to drawing binary tanglegrams
• Fixed-parameter algorithms in analysis of heuristics for extracting networks in linear programs
• Maximum balanced subgraph problem parameterized above lower bound
• scientific article; zbMATH DE number 1472163 (Why is no real title available?)
• Maximum balanced subgraph problem parameterized above lower bound
• Parameterized algorithms for the 2-clustering problem with minimum sum and minimum sum of squares objective functions
• Frustration and isoperimetric inequalities for signed graphs
• Separator-based data reduction for signed graph balancing
• Spectral aspects of symmetric matrix signings

This page was built for publication: Optimal Edge Deletions for Signed Graph Balancing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5432322)