Separator-based data reduction for signed graph balancing

Journal of Combinatorial Optimization

Volumn 20, Issue 4, 2010, Pages 335-360

  Hüffner, Falk ^a   Betzler, Nadja ^a   Niedermeier, Rolf ^a  

^a FRIEDRICH SCHILLER UNIVERSITY JENA   (Germany)

Author keywords

Algorithm engineering; Exact algorithm; Financial network; Gene regulatory network; Parameterized algorithmics; Preprocessing

Indexed keywords

ALGORITHM ENGINEERING; EXACT ALGORITHMS; FINANCIAL NETWORKS; PARAMETERIZED; PREPROCESSING;

ALGORITHMS; GENES; OPERATIONS RESEARCH; SEPARATORS; STATISTICS;

DATA REDUCTION;

EID: 78149285533     PISSN: 13826905     EISSN: 15732886     Source Type: Journal    
DOI: 10.1007/s10878-009-9212-2     Document Type: Article

References (57)

1. Abu-Khzam FN, Collins RL, Fellows MR, Langston MA, Suters WH, Symons CT (2004) Kernelization algorithms for the vertex cover problem: Theory and experiments. In: Proceedings of the 6th workshop on algorithm engineering and experiments (ALENEX '04). SIAM, pp 62-69
2. FN Abu-Khzam MR Fellows MA Langston WH Suters 2007 Crown structures for vertex cover kernelization Theory Comput Syst 41 3 411 430 1148.68035 10.1007/s00224-007-1328-0 2352539
3. Agarwal A, Charikar M, Makarychev K, Makarychev Y (2005) Approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems. In: Proceedings of the 37th ACM symposium on theory of computing (STOC '05). ACM, pp 573-581
4. T Antal PL Krapivsky S Redner 2006 Social balance on networks: The dynamics of friendship and enmity Physica D: Nonlinear Phenom 224 1-2 130 136 1130.91041 10.1016/j.physd.2006.09.028 2301516
5. A Avidor M Langberg 2007 The multi-multiway cut problem Theor Comput Sci 377 1-3 35 42 1115.68171 10.1016/j.tcs.2007.02.026 2323384
6. Barahona F (1980) On the complexity of max cut. Tech Rep 186, IMAG, Université Joseph Fourier, Grenoble, France
7. F Barahona 1982 On the computational complexity of Ising spin glass models J Phys A: Math Gen 15 10 3241 3253 10.1088/0305-4470/15/10/028 684591
8. F Barahona A Ridha Mahjoub 1989 Facets of the balanced (acyclic) induced subgraph polytope Math Program 45 1-3 21 33 0675.90071 10.1007/BF01589094
9. AI Barvinok K Woods 2003 Short rational generating functions for lattice point problems J Am Math Soc 16 4 957 979 1017.05008 10.1090/S0894-0347-03- 00428-4 1992831
10. HL Bodlaender AMCA Koster 2008 Combinatorial optimization on graphs of bounded treewidth Comput J 51 255 269 10.1093/comjnl/bxm037 2385750
11. V Boginski S Butenko PM Pardalos 2005 Statistical analysis of financial networks Comput Stat Data Anal 48 2 431 443 05374112 10.1016/j.csda.2004.02.004 2133596
12. V Boginski S Butenko PM Pardalos 2006 Mining market data: A network approach Comput Oper Res 33 11 3171 3184 1113.90079 10.1016/j.cor.2005.01.027
13. E Boros PL Hammer 1991 The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds Ann Oper Res 33 3 151 180 0741.90077 10.1007/BF02115753 1140978
14. J Chen IA Kanj W Jia 2001 Vertex cover: Further observations and further improvements J Algorithms 41 2 280 301 1017.68087 10.1006/jagm.2001.1186 1869253
15. C Chiang AB Kahng S Sinha X Xu AZ Zelikovsky 2007 Fast and efficient bright-field AAPSM conflict detection and correction IEEE Trans Comput-Aided Des Integr Circ Syst 26 1 115 126 10.1109/TCAD.2006.882642
16. Coleman T, Saunderson J, Wirth A (2008) A local-search 2-approximation for 2-correlation-clustering. In: Proceedings of the 16th annual European symposium on algorithms (ESA '08). LNCS, vol 5193. Springer, Berlin, pp 308-319
17. B DasGupta GA Enciso ED Sontag Y Zhang 2007 Algorithmic and complexity results for decompositions of biological networks into monotone subsystems Biosystems 90 1 161 178 10.1016/j.biosystems.2006.08.001
18. Downey RG, Fellows MR (1999) Parameterized complexity. Springer, Berlin
19. Estivill-Castro V, Fellows MR, Langston MA, Rosamond FA (2006) FPT is P-time extremal structure I. In: Proceedings of the 1st algorithms and complexity in Durham workshop (ACiD '06). Texts in Algorithmics, vol 4. College Publications, pp 1-41
20. AM Feist JCM Scholten B∅ Palsson FJ Brockman T Ideker 2006 Modeling methanogenesis with a genome-scale metabolic reconstruction of Methanosarcina barkeri Mol Syst Biol 2 2006 10.1038/msb4100046.0004
21. Fellows MR, Langston MA (1989) An analogue of the Myhill-Nerode theorem and its use in computing finite-basis characterizations. In: Proceedings of the 30th annual IEEE symposium on foundations of computer science (FOCS '89). IEEE, pp 520-525
22. Flum J, Grohe M (2006) Parameterized complexity theory. Springer, Berlin
23. HN Gabow 2000 Path-based depth-first search for strong and biconnected components Inf Process Lett 74 3-4 107 114 10.1016/S0020-0190(00)00051-X 1761551
24. MX Goemans DP Williamson 1995 Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming J ACM 42 6 1115 1145 0885.68088 10.1145/227683.227684 1412228
25. M Grötschel WR Pulleyblank 1981 Weakly bipartite graphs and the max-cut problem Oper Res Lett 1 1 23 27 0494.90078 10.1016/0167-6377(81)90020-1 643056
26. J Guo R Niedermeier 2007 Invitation to data reduction and problem kernelization ACM SIGACT News 38 1 31 45 10.1145/1233481.1233493
27. Guo J, Hüffner F, Niedermeier R (2004) A structural view on parameterizing problems: Distance from triviality. In: Proceedings of the 1st international workshop on parameterized and exact computation (IWPEC '04). LNCS, vol 3162. Springer, Berlin, pp 162-173
28. J Guo J Gramm F Hüffner R Niedermeier S Wernicke 2006 Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization J Comput Syst Sci 72 8 1386 1396 1119.68134 10.1016/j.jcss.2006. 02.001
29. Guo J, Moser H, Niedermeier R (2008) Iterative compression for exactly solving NP-hard minimization problems. In: Proceedings of the DFG SPP 1126 "algorithmics of large and complex networks". LNCS. Springer, Berlin, to appear
30. Gutwenger C, Mutzel P (2000) A linear time implementation of SPQR-trees. In: Proceedings of the 8th international symposium on graph drawing (GD '00). LNCS, vol 1984. Springer, Berlin, pp 77-90
31. F Harary 1953 On the notion of balance of a signed graph Michigan Math J 2 2 143 146 10.1307/mmj/1028989917 67468
32. F Harary 1959 On the measurement of structural balance Behav Sci 4 4 316 323 10.1002/bs.3830040405
33. F Harary MH Lim DC Wunsch 2002 Signed graphs for portfolio analysis in risk management IMA J Manag Math 13 3 201 210 1065.91025 10.1093/imaman/13.3.201
34. MR Henzinger S Rao HN Gabow 2000 Computing vertex connectivity: New bounds from old techniques J Algorithms 43 2 222 250 10.1006/jagm.1999.1055 1734800
35. Hicks IV, Koster AMCA, Kolotoǧlu E (2005) Branch and tree decomposition techniques for discrete optimization. In: TutORials 2005, tutorials in operations research, INFORMS, pp 1-29
36. JE Hopcroft RE Tarjan 1973 Dividing a graph into triconnected components SIAM J Comput 2 3 135 158 10.1137/0202012 327391
37. Hüffner F (2005) Algorithm engineering for optimal graph bipartization. In: Proceedings of the 4th international workshop on experimental and efficient algorithms (WEA '05). LNCS, vol 3503. Springer, Berlin, pp 240-252. Extended version to appear in J Graph Algorithms Appl
38. Hüffner F (2007) Algorithms and experiments for parameterized approaches to hard graph problems. PhD thesis, Institut für Informatik, Friedrich-Schiller-Universität Jena
39. Hüffner F, Komusiewicz C, Moser H, Niedermeier R (2008) Fixed-parameter algorithms for cluster vertex deletion. In: Proceedings of the 8th Latin American theoretical informatics symposium (LATIN '08). LNCS, vol 4598. Springer, Berlin, pp 711-722. Extended version to appear in Theory Comput Syst
40. Khot S (2002) On the power of unique 2-prover 1-round games. In: Proceedings of the 34th ACM symposium on theory of computing (STOC '02). ACM, pp 767-775
41. Konig D (1936) Theorie der endlichen und unendlichen Graphen. Akademische Verlagsgesellschaft, Leipzig, English translation: Theory of finite and infinite graphs, Birkhäuser, 1990
42. Leroy X, Vouillon J, Doligez D et al (1996) The objective caml system. Available on the web, http://caml.inria.fr/ocaml/
43. Makhorin A (2004) GNU linear programming kit reference manual version 4.8. Department of Applied Informatics, Moscow Aviation Institute
44. H Mi B Lazareva-Ulitsky R Loo A Kejariwal J Vandergriff S Rabkin N Guo A Muruganujan O Doremieux MJ Campbell H Kitano PD Thomas 2005 The PANTHER database of protein families, subfamilies, functions and pathways Nucleic Acids Res 33 Supplement 1 284 288
45. Niedermeier R (2006) Invitation to fixed-parameter algorithms. Oxford University Press, Oxford
46. K Oda H Kitano 2006 A comprehensive map of the toll-like receptor signaling network Mol Syst Biol 2 2006.0015 10.1038/msb4100057
47. K Oda T Kimura Y Matsuoka A Funahashi M Muramatsu H Kitano 2004 Molecular interaction map of a macrophage AfCS Res Rep 2 14
48. CH Papadimitriou M Yannakakis 1991 Optimization, approximation, and complexity classes J Comput Syst Sci 43 3 425 440 0765.68036 10.1016/0022-0000(91)90023-X 1135471
49. Polzin T, Vahdati Daneshmand S (2006) Practical partitioning-based methods for the Steiner problem. In: Proceedings of the 4th international workshop on experimental and efficient algorithms (WEA '06). LNCS, vol 4007. Springer, Berlin, pp 241-252
50. Razgon I, O'Sullivan B (2008) Almost 2-SAT is fixed-parameter tractable. In: Proceedings of the 35th international colloquium on automata, languages and programming (ICALP '08). LNCS, vol 5125. Springer, Berlin, pp 551-562
51. B Reed K Smith A Vetta 2004 Finding odd cycle transversals Oper Res Lett 32 4 299 301 1052.05061 10.1016/j.orl.2003.10.009 2057781
52. Sturmfels B (1996) Gröbner bases and convex polytopes. University lecture series, vol 8. American Mathematical Society, Providence
53. P Thagard K Verbeurgt 1998 Coherence as constraint satisfaction Cogn Sci 22 1 1 24 10.1207/s15516709cog2201-1
54. E Volz 2004 Random networks with tunable degree distribution and clustering Phys Rev E 70 5 056115 10.1103/PhysRevE.70.056115
55. Wernicke S (2003) On the algorithmic tractability of single nucleotide polymorphism (SNP) analysis and related problems. Diplomarbeit, Wilhelm-Schickard-Institut für Informatik, Universität Tübingen
56. M Yannakakis 1981 Edge-deletion problems SIAM J Comput 10 2 297 309 0468.05043 10.1137/0210021 615220
57. Zaslavsky T (1998) Bibliography of signed and gain graphs. Electronic Journal of Combinatorics DS8, updated version available at http://www.math. binghamton.edu/zaslav/Bsg/