Improved exact exponential algorithms for vertex bipartization and other problems

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

Volumn 3701 LNCS, Issue , 2005, Pages 375-389

  Raman, Venkatesh ^a   Saurabh, Saket ^a   Sikdar, Somnath ^a  

^a INSTITUTE OF MATHEMATICAL SCIENCES   (India)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; GRAPH THEORY; PROBLEM SOLVING;

BRANCH-AND-BOUND TECHNIQUE; FEEDBACK ARC SET PROBLEM; VERTEX BIPARTIZATION;

ALGORITHMS;

EID: 33646184571     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11560586_30     Document Type: Conference Paper

References (17)

1. J. M. BYSKOV. On the Number of Maximal Bipartite Subgraphs of a Graph. Journal of Graph Theory 48 (2): 127-135, 2005.
2. H. CHOI, K. NAKAJIMA AND C. S. RIM. Graph Bipartization and Via Minimization. SIAM Journal of Discrete Mathematics 2 (1): 38-47, 1989.
3. R. DOWNEY AND M. FELLOWS. Parameterized Complexity. Springer-Verlag, 1999.
4. R. DOWNEY AND M. FELLOWS. Parameterized Complexity for the Skeptic. In the Proc. of 18th CCC : 147-169, 2003.
5. N. GARG, V. VAZIRANI AND M. YANNAKAKIS. Approximate Max-Flow Min(Multi) Cut Theorems and Their Applications. SIAM Journal on Computing 25 (2): 235-251, 1996.
6. J. GRAMM, E. A. HIRSCH, R. NIEDERMEIER, AND P. ROSSMANITH Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT. Discrete Applied Mathematics 130 (2): 139-155, 2003.
7. J. GUO, J. GRAMM, F. HÜFFNER, R. NEIDERMEIER AND S. WERNICKE. Improved Fixed-Parameter Algorithms for Two Feedback Set Problems. To appear in the proceedings of 9th Workshop on Algorithms and Data Structures (WADS). Springer Verlag, Lecture Notes in Computer Science, 2005.
8. R. NIEDERMEIER AND P. ROSSMANITH. An efficient fixed parameter algorithm for 3-Hitting Set. Journal of Discrete Algorithms 1 (1): 89-102, 2003.
9. S. POLJAK AND D. TURZIK. A Polynomial Algorithm for Constructing a Large Bipartite Subgraph, with an Application to a Satisfiability Problem. Canad. J. Math 34 (3): 519-524, 1982.
10. V. RAMAN, AND S. SAURABH. Improved Parameterized Algorithms for Feedback Set Problems in Weighted Tournaments. In the Proc. of 1st International Workshop on Exact and Parameterized Algorithms (IWPEC): 260-270, 2004.
11. V. RAMAN, S. SAURABH, AND S. SIKDAR. Exact Algorithms for Odd Cyde Transversal and Other Problems. Technical Report, IMSC-2005-06-16, The Institute of Mathematical Sciences, 2005.
12. B. REED, K. SMITH AND A. VETTA. Finding Odd Cyde Transversals, Operations Research Letters 32: 299-301, 2004.
13. R. RIZZI, V. BAFNA, S. ISTRAIL AND G. LANCIA. Practical Algorithms and Fixed-Parameter Tractability for the Single Individual SNP Haplotyping Problem. In the Proc of WABI: 29-43, 2002.
14. S. UENO, Y. KAJITANI AND S. GOTOH. On the Nonseparating Independent Set Problem and Feedback Set Problem for Graphs with no Vertex Degree Exceeding Three. Discrete Mathematics 72: 355-360, 1988.
15. M. WAHLSTRÖM. Exact algorithms for finding minimum transversals in rank-3 hypergraphs. Journal of Algorithms 51(2): 107 - 121, 2004.
16. G. WOEGINGER. Exact algorithms for NP-hard problems: A survey. In Combinatorial Optimization - Eureka! You shrink! Springer LNCS 2570: 185-207, 2003.
17. X. ZHUNAG AND S. PANDE. Resolving Register Bank Conflicts for a Network Processor. In Proc. of 12th PACT: 260-278, 2003.