Optimal Edge Deletions for Signed Graph Balancing
From MaRDI portal
Publication:5432322
DOI10.1007/978-3-540-72845-0_23zbMath1203.68125OpenAlexW1495338626MaRDI QIDQ5432322
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
Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
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 ⋮ Attractors in coherent systems of differential equations ⋮ 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 ⋮ Spectral aspects of symmetric matrix signings
