Algorithm engineering for optimal Graph Bipartization

Journal of Graph Algorithms and Applications

Volumn 13, Issue 2, 2009, Pages 77-98

  Hüffner, Falk ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 71449099145     PISSN: None     EISSN: 15261719     Source Type: Journal    
DOI: 10.7155/jgaa.00177     Document Type: Article

References (39)

1. A. Abdullah. On graph bipartization. In Proc. 1992 IEEE International Symposium on Circuits and Systems (ISCAS'92), volume 4, pages 1847-1850,1992.
2. H. L. Bodlaender. A cubic kernel for feedback vertex set. In Proc. 24th An- nual Symposium on Theoretical Aspects of Computer Science (STACS'07), volume 4393 of LNCS, pages 320-331. Springer, 2007.
3. K. Burrage, V. Estivill-Castro, M. R. Fellows, M. A. Langston, S. Mac, and F. A. Rosamond. The undirected feedback vertex set problem has a poly(k) kernel. In Proc. 2nd International Workshop on Parameterized and Exact Computation (IWPEC'06), volume 4169 of LNCS, pages 192-202. Springer, 2006.
4. J. Chen, F. V. Fomin, Y. Liu, S. Lu, and Y. Villanger. Improved algo- rithms for the feedback vertex set problems. In Proc. 10th Workshop on Algorithms and Data Structures (WADS'07), volume 4619 of LNCS, pages 422-433. Springer, 2007. To appear under the title "Improved algorithms for feedback vertex set problems" in Journal of Computer and System Sci- ences.
5. J. Chen, Y. Liu, S. Lu, B. O'Sullivan, and I. Razgon. A fixed-parameter algorithm for the directed feedback vertex set problem. In Proc. 40th ACM Symposium on Theory of Computing (STOC'08), pages 177-186. ACM, 2008. To appear in Journal of the ACM.
6. H.-A. Choi, K. Nakajima, and C. S. Rim. Graph bipartization and via minimization. SIAM Journal on Discrete Mathematics, 2(1):38-47, 1989.
7. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. MIT Press, 2nd edition, 2001.
8. 3) FPT algorithm for the undirected feedback vertex set problem. Theory of Computing Systems, 41(3):479-492, 2007.
9. V. Deolalikar, M. R. Mesarina, J. Recker, and S. Pradhan Perturbative time and frequency allocations for RFID reader networks. In Proc. 2006 Workshop on Emerging Directions in Embedded and Ubiquitous Computing (EUC'06), volume 4097 of LNCS, pages 392-402. Springer, 2006.
10. E. A. Dinic. Algorithm for solution of a problem of maximum flow in networks with power estimation (in Russian). Doklady Akademii Nauk SSSR, 194(4), 1970. English translation in Soviet Mathematics Doklady, 11:1277-1280, 1970.
11. M. Dom, J. Guo, F. Hüffner, R. Niedermeier, and A. Truß. Fixed-parameter tractability results for feedback set problems in tournaments. In Proc. 6th Italian Conference on Algorithms and Complexity (CIAC'06), volume 3998 of LNCS, pages 320-331. Springer, 2006.
12. R. G. Downey and M. R. Fellows. Parameterized Complexity. Springer, 1999.
13. J. Edmonds and R. M. Karp. Theoretical improvements in algorithmic efficiency for network flow problems. Journal of the ACM, 19(2):248-264, 1972.
14. J. Flum and M. Grohe. Parameterized Complexity Theory. Springer, 2006.
15. F. V. Fomin, F. Grandoni, and D. Kratsch. Some new techniques in design and analysis of exact (exponential) algorithms. Bulletin of the EATCS, 87: 47-77, 2005.
16. P. Fouilhoux and A. Ridha Mahjoub. Polyhedral results for the bipartite induced subgraph problem. Discrete Applied Mathematics, 154(15):2128-2149,2006.
17. N. Garg, V. V. Vazirani, and M. Yannakakis. Multiway cuts in directed and node weighted graphs. In Proc. 21st International Colloquium on Automata, Languages and Programming (ICALP'94), volume 820 of LNCS, pages 487-498. Springer, 1994.
18. D.-J. Guan. Generalized Gray codes with applications. Proc. National Science Council, Republic of China (A), 22(6):841-848, 1998.
19. N. Gülpinar, G. Gutin, G. Mitra, and A. Zverovich. Extracting pure net-work submatrices in linear programs using signed graphs. Discrete Applied Mathematics, 137(3):359-372, 2004.
20. J. Guo, J. Gramm, F. Hüffner, R. Niedermeier, and S. Wernicke. Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization. Journal of Computer and System Sciences, 72(8):1386-1396,2006.
21. F. Hüffner, N. Betzler, and R. Niedermeier. Optimal edge deletions for signed graph balancing. In Proc. 6th Workshop on Experimental Algorithms (WEA'07), volume 4525 of LNCS, pages 297-310. Springer, 2007.
22. F. Hüffner, C. Komusiewicz, H. Moser, and R. Niedermeier. Fixed-parameter algorithms for cluster vertex deletion. In Proc. 8th Latin American Theoretical Informatics Symposium (LATIN'08), volume 4598 of LNCS, pages 711-722. Springer, 2008.
23. F. Hüffner, R. Niedermeier, and S. Wernicke. Techniques for practical fixed-parameter algorithms. The Computer Journal, 51(1):7-25, 2008.
24. A. B. Kahng, S. Vaya, and A. Z. Zelikovsky. New graph bipartizations for double-exposure, bright field alternating phase-shift mask layout. In Proc. Asia and South Pacific Design Automation Conference, pages 133-138,2001.
25. J. M. Lewis and M. Yannakakis. The node-deletion problem for hereditary properties is NP-complete. Journal of Computer and System Sciences, 20 (2):219-230, 1980.
26. C. Lund and M. Yannakakis. The approximation of maximum subgraph problems. In Proc. 20th International Colloquium on Automata, Languages and Programming (ICALP'93), volume 700 of LNCS, pages 40-51. Springer, 1993.
27. M. Mahajan and V. Raman. Parameterizing above guaranteed values: MaxSat and MaxCut. Journal of Algorithms, 31(2):335-354, 1999.
28. A. Makhorin. GNU Linear Programming Kit Reference Manual Version 4.8. Department of Applied Informatics, Moscow Aviation Institute, 2004.
29. nd International Workshop on Graph-Theoretic Concepts in Computer Science (WG'06), volume 4271 of LNCS, pages 37-48. Springer, 2006.
30. R. Niedermeier. Invitation to Fixed-Parameter Algorithms. Number 31 in Oxford Lecture Series in Mathematics and Its Applications. Oxford University Press, 2006.
31. A. Panconesi and M. Sozio. Fast hare: A fast heuristic for single individual SNP haplotype reconstruction. In Proc. 4th International Workshop on Algorithms in Bioinformatics (WABI'04), volume 3240 of LNCS, pages 266-277. Springer, 2004.
32. V. Raman, S. Saurabh, and S. Sikdar. Efficient exact algorithms through enumerating maximal independent sets and other techniques. Theory of Computing Systems, 41(3):563-587, 2007.
33. B. Reed, K. Smith, and A. Vetta. Finding odd cycle transversals. Operations Research Letters, 32(4):299-301, 2004.
34. R. Rizzi, V. Bafna, S. Istrail, and G. Lancia. Practical algorithms and fixed-parameter tractability for the single individual SNP haplotyping problem. In Proc. 2nd International Workshop on Algorithms in Bioinformatics (WABI'02), volume 2452 of LNCS, pages 29-43. Springer, 2002.
35. A. Schrijver. Theory of Linear and Integer Programming. Wiley, 1998.
36. S. Wernicke. On the Algorithmic Tractability of Single Nucleotide Polymorphism (SNP) Analysis and Related Problems. Diplomarbeit, WilhelmSchickard-Institut für Informatik, Universität Tübingen, 2003.
37. G. J. Woeginger. Exact algorithms for NP-hard problems: A survey. In Proc. 5th International Workshop on Combinatorial Optimization, volume 2570 of LNCS, pages 185-208. Springer, 2003.
38. X.-S. Zhang, R.-S. Wang, L.-Y. Wu, and L. Chen. Models and algorithms for haplotyping problem. Current Bioinformatics, 1(1):104-114, 2006.
39. X. Zhuang and S. Pande. Resolving register bank conflicts for a network processor. In Proc. 12th International Conference on Parallel Architec- tures and Compilation Techniques (PACT'03), pages 269-278. IEEE Press, 2003.