Optimal edge deletions for signed graph balancing

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4525 LNCS, Issue , 2007, Pages 297-310

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

^a FRIEDRICH SCHILLER UNIVERSITY JENA   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; DATA REDUCTION; GRAPH THEORY; ITERATIVE METHODS; OPTIMIZATION; PARAMETER ESTIMATION;

EDGE LABELS; GRAPH BALANCING; PARAMETER ALGORITHMS; SOCIAL NETWORKS; SYSTEMS BIOLOGY;

EDGE DETECTION;

EID: 37149033777     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-72845-0_23     Document Type: Conference Paper

References (22)

1. Avidor, A., Langberg, M.: The multi-multiway cut problem. In: Hagerup, T., Katajainen, J. (eds.) SWAT 2004. LNCS, vol. 3111, pp. 273-284. Springer, Heidelberg (2004)
2. Chiang, C., Kahng, A.B., Sinha, S., Xu, X., Zelikovsky, A.Z.: Fast and efficient bright-field AAPSM conflict detection and correction. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 26(1), 115-126 (2007)
3. DasGupta, B., Enciso, G.A., Sontag, E.D., Zhang, Y.: Algorithmic and complexity results for decompositions of biological networks into monotone subsystems. In: Alvarez, C., Serna, M. (eds.) WEA 2006. LNCS, vol. 4007, pp. 253-264. Springer, Heidelberg (2006)
4. Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)
5. Feist, A.M., Schölten, J.C.M., Palsson, B.Ø., Brockman, F.J., Ideker, T.: Modeling methanogenesis with a genome scale metabolic reconstruction of Methanosarcina barkeri. Molecular Systems Biology, 2(2006.0004) (2006)
6. Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)
7. Gabow, H.N.: Path-based depth-first search for strong and biconnected components. Information Processing Letters 74(3-4), 107-114 (2000)
8. Guo, J., Gramm, J., Hüffner, F., Niedermeier, R., Wernicke, S.: Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization. Journal of Computer and System Sciences 72(8), 1386-1396 (2006)
9. Guo, J., Niedermeier, R.: Invitation to data reduction and problem kernelization. ACM SIGACT News 38(1), 31-45 (2007)
10. Gutwenger, C., Mutzel, P.: A linear time implementation of SPQR-trees. In: Marks, J. (ed.) GD 2000. LNCS, vol. 1984, pp. 77-90. Springer, Heidelberg (2001)
11. Harary, F.: On the notion of balance of a signed graph. Michigan Mathematical Journal 2(2), 143-146 (1953)
12. Henzinger, M.R., Rao, S., Gabow, H.N.: Computing vertex connectivity: New bounds from old techniques. Journal of Algorithms 43(2), 222-250 (2000)
13. Hopcroft, J.E., Tarjan, R.E.: Dividing a graph into triconnected components. SIAM Journal on Computing 2(3), 135-158 (1973)
14. Hüffner, F.: Algorithm engineering for optimal graph bipartization. In: Nikoletseas, S.E. (ed.) WEA 2005. LNCS, vol. 3503, pp. 240-252. Springer, Heidelberg (2005)
15. Khot, S.: On the power of unique 2-prover 1-round games. In: Proc. 34th STOC, pp. 767-775. ACM Press, New York (2002)
16. Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press, Oxford (2006)
17. Oda, K., Kimura, T., Matsuoka, Y., Funahashi, A., Muramatsu, M., Kitano, H.: Molecular interaction map of a macrophage. Research Report, http://www.systems-biology.org/001/010.html (August 2004)
18. Oda, K., Kitano, H.: A comprehensive, map of the toll-like receptor signaling network. Molecular Systems Biology, 2(2006.0015) (2006)
19. Polzin, T., Vahdati Daneshmand, S.: Practical partitioning-based methods for the Steiner problem. In: Alvarez, C., Serna, M. (eds.) WEA 2006. LNCS, vol. 4007, pp. 241-252. Springer, Heidelberg (2006)
20. Vazirani, V.V.: Approximation Algorithms. Springer, Heidelberg (2001)
21. VoIz, E.: Random networks with tunable degree distribution and clustering. Physical Review E, 70:056115 (2004)
22. Zaslavsky, T.: Bibliography of signed and gain graphs. Electronic Journal of Combinatorics, DS8 (1998)