Approximation algorithms for orienting mixed graphs

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

Volumn 6661 LNCS, Issue , 2011, Pages 416-428

  Elberfeld, Michael ^a   Segev, Danny ^b   Davidson, Colin R ^c   Silverbush, Dana ^d   Sharan, Roded ^d  

^a UNIVERSITY OF LÜBECK   (Germany)

^b UNIVERSITY OF HAIFA   (Israel)

^c UNIVERSITY OF WATERLOO   (Canada)

^d TEL AVIV UNIVERSITY   (Israel)

Author keywords

approximation algorithm; graph orientation; mixed graph; protein protein interaction network

Indexed keywords

APPROXIMABILITY; FUNDAMENTAL PROBLEM; GRAPH ORIENTATION; INPUT GRAPHS; MIXED GRAPH; PROTEIN NETWORK; PROTEIN-PROTEIN INTERACTION NETWORKS; VERTEX PAIRS;

ELECTROSTATIC DISCHARGE; GRAPH THEORY; PATTERN MATCHING; PROTEINS;

APPROXIMATION ALGORITHMS;

EID: 79960100533     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-21458-5_35     Document Type: Conference Paper

References (23)

1. Arkin, E.M., Hassin, R.: A note on orientations of mixed graphs. Discrete Applied Mathematics 116(3), 271-278 (2002)
2. Bafna, V., Berman, P., Fujito, T.: A 2-approximation algorithm for the undirected feedback vertex set problem. SIAM Journal on Discrete Mathematics 12(3), 289-297 (1999)
3. Bang-Jensen, J., Gutin, G.: Digraphs: Theory, Algorithms and Applications, 2nd edn. Springer, Heidelberg (2008)
4. Barabási, A.-L., Oltvai, Z.N.: Network biology: understanding the cell's functional organization. Nature Reviews Genetics 5(2), 101-113 (2004)
5. Boesch, F., Tindell, R.: Robbins's theorem for mixed multigraphs. The American Mathematical Monthly 87(9), 716-719 (1980)
6. Chen, J., Fomin, F.V., Liu, Y., Lu, S., Villanger, Y.: Improved algorithms for feedback vertex set problems. Journal of Computer and System Sciences 74(7), 1188-1198 (2008)
7. Chung, F.R.K., Garey, M.R., Tarjan, R.E.: Strongly connected orientations of mixed multigraphs. Networks 15(4), 477-484 (1985)
8. Cohen, R., Havlin, S., ben-Avraham, D.: Structural properties of scale-free networks. In: Handbook of Graphs and Networks: From the Genome to the Internet. Wiley-VCH, Weinheim (2002)
9. Dorn, B., Hüffner, F., Krüger, D., Niedermeier, R., Uhlmann, J.: Exploiting bounded signal flow for graph orientation based on cause-effect pairs (To appear). In: Marchetti-Spaccamela, A., Segal, M. (eds.) TAPAS 2011. LNCS, vol. 6595, pp. 104-115. Springer, Heidelberg (2011)
10. Fields, S.: High-throughput two-hybrid analysis. The promise and the peril. The FEB Journal 272(21), 5391-5399 (2005)
11. Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)
12. Frederickson, G.N., Johnson, D.B.: Generating and searching sets induced by networks. In: ICALP 1980. LNCS, vol. 85, pp. 221-233. Springer, Heidelberg (1980)
13. Gamzu, I., Segev, D., Sharan, R.: Improved orientations of physical networks. In: Moulton, V., Singh, M. (eds.) WABI 2010. LNCS, vol. 6293, pp. 215-225. Springer, Heidelberg (2010)
14. Gavin, A., Bösche, M., Krause, R., Grandi, P., Marzioch, M., Bauer, A., Schultz, J., Rick, J.M., Michon, A.-M., Cruciat, C.-M., Remor, M., Hovfert, C., Schelder, M., Brajenovic, M., Ruffner, H., Merino, A., Klein, K., Hudak, M., Dickson, D., Rudi, T., Gnau, V., Bauch, A., Bastuck, S., Huhse, B., Leutwein, C., Heurtier, M.-A., Copley, R.R., Edelmann, A., Querfurth, E., Rybin, V., Drewes, G., Raida, M., Bouwmeester, T., Bork, P., Seraphin, B., Kuster, B., Neubauer, G., Superti- Furga, G.: Functional organization of the yeast proteome by systematic analysis of protein complexes. Nature 415(6868), 141-147 (2002)
15. Hakimi, S.L., Schmeichel, E.F., Young, N.E.: Orienting graphs to optimize reachability. Information Processing Letters 63(5), 229-235 (1997)
16. Håstad, J.: Some optimal inapproximability results. Journal of the ACM 48(4), 798-859 (2001)
17. Karp, R.M.: Reducibility among combinatorial problems. In: Complexity of Computer Computations, pp. 85-103. Plenum Press, New York (1972)
18. Medvedovsky, A., Bafna, V., Zwick, U., Sharan, R.: An algorithm for orienting graphs based on cause-effect pairs and its applications to orienting protein networks. In: Crandall, K.A., Lagergren, J. (eds.) WABI 2008. LNCS (LNBI), vol. 5251, pp. 222-232. Springer, Heidelberg (2008)
19. Newman, M.E.J.: The structure and function of complex networks. SIAM Review 45(2), 167-256 (2003)
20. Robbins, H.E.: A theorem on graphs, with an application to a problem of traffic control. The American Mathematical Monthly 46(5), 281-283 (1939)
21. Silverbush, D., Elberfeld, M., Sharan, R.: Optimally orienting physical networks. In: Bafna, V., Sahinalp, S.C. (eds.) RECOMB 2011. LNCS, vol. 6577, pp. 424-436. Springer, Heidelberg (2011)
22. Tarjan, R.E.: A note on finding the bridges of a graph. Information Processing Letters 2(6), 160-161 (1974)
23. Yeang, C., Ideker, T., Jaakkola, T.: Physical network models. Journal of Computational Biology 11(2-3), 243-262 (2004)