Partition Into Triangles on Bounded Degree Graphs

Theory of Computing Systems

Volumn 52, Issue 4, 2013, Pages 687-718

  van Rooij, Johan M M ^a   van Kooten Niekerk, Marcel E ^a   Bodlaender, Hans L ^a  

^a UTRECHT UNIVERSITY   (Netherlands)

Author keywords

Algorithms; Bounded degree graphs; Exact algorithms; Graph algorithms; Partition into triangles; Satisfiability

Indexed keywords

ALGORITHMS; CLUSTERING ALGORITHMS; GRAPHIC METHODS; POLYNOMIAL APPROXIMATION;

BOUNDED DEGREE GRAPHS; EXACT ALGORITHMS; EXPONENTIAL TIME HYPOTHESIS; LINEAR-TIME ALGORITHMS; MAXIMUM DEGREE; POLYNOMIAL-TIME; SATISFIABILITY; SUBEXPONENTIAL TIME;

GRAPH ALGORITHMS;

EID: 84876128691     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s00224-012-9412-5     Document Type: Article

References (24)

1. Beigel, R.: Finding maximum independent sets in sparse and general graphs. In: 10th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1999, pp. 856-857. Society for Industrial and Applied Mathematics, Philadelphia (1999).
2. Björklund, A.: Exact covers via determinants. In: Marion, J.-Y., Schwentick, T. (eds.) 27th International Symposium on Theoretical Aspects of Computer Science, STACS 2010. Leibniz International Proceedings in Informatics, vol. 3, pp. 95-106. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Leibniz (2010).
3. Björklund, A., Husfeldt, T.: Exact algorithms for exact satisfiability and number of perfect matchings. Algorithmica 52(2), 226-249 (2008).
4. Björklund, A., Husfeldt, T., Koivisto, M.: Set partitioning via inclusion-exclusion. SIAM J. Comput. 39(2), 546-563 (2009).
5. Bourgeois, N., Escoffier, B., Paschos, V. Th., van Rooij, J. M. M.: Fast algorithms for max independent set. Algorithmica 62(1-2), 382-415 (2010).
6. Byskov, J. M., Madsen, B. A., Skjernaa, B.: New algorithms for exact satisfiability. Theor. Comput. Sci. 332(1-3), 515-541 (2005).
7. Dahllöf, V., Jonsson, P., Beigel, R.: Algorithms for four variants of the exact satisfiability problem. Theor. Comput. Sci. 320(2-3), 373-394 (2004).
8. Drori, L., Peleg, D.: Faster exact solutions for some NP-hard problems. Theor. Comput. Sci. 287(2), 473-499 (2002).
9. Fomin, F. V., Kratsch, D.: Exact Exponential Algorithms. Texts in Theoretical Computer Science. Springer, Berlin (2010).
10. Garey, M. R., Johnson, D. S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York (1979).
11. Impagliazzo, R., Paturi, R.: On the complexity of k-SAT. J. Comput. Syst. Sci. 62(2), 367-375 (2001).
12. Impagliazzo, R., Paturi, R., Zane, F.: Which problems have strongly exponential complexity? J. Comput. Syst. Sci. 63(4), 512-530 (2001).
13. Kann, V.: Maximum bounded 3-dimensional matching is MAX SNP-complete. Inf. Process. Lett. 37(1), 27-35 (1991).
14. Koivisto, M.: Partitioning into sets of bounded cardinality. In: Chen, J., Fomin, F. V. (eds.) 4th International Workshop on Parameterized and Exact Computation, IWPEC 2009. Lecture Notes in Computer Science, vol. 5917, pp. 258-263. Springer, Berlin (2009).
15. 0. 16254n) for exact 3-satisfiability: a simpler proof. Zap. Nauchn. Semin. POMI 293, 118-128 (2002). English translation: J. Math. Sci. 293, 1995-1999 (2005).
16. Kullmann, O., Luckhardt, H.: Deciding propositional tautologies: algorithms and their complexity. Technical report, Fachbereich Mathematik, Johann Wolfgang Goethe-Universität, Frankfurt, Germany (1997).
17. Lipton, R. J.: Fast Exponential Algorithms. Weblog: Gödel's Lost Letter and P=NP, February 13 (2009). http://rjlipton. wordpress. com/2009/02/13/polynomial-vs-exponential-time.
18. Madsen, B. A.: An algorithm for exact satisfiability analysed with the number of clauses as parameter. Inf. Process. Lett. 97(1), 28-30 (2006).
19. Monien, B., Speckenmeyer, E., Vornberger, O.: Upper bounds for covering problems. Methods Oper. Res. 43, 419-431 (1981).
20. 0. 16254n). Ann. Math. Artif. Intell. 43(1), 173-193 (2005).
21. Schaefer, T. J.: The complexity of satisfiability problems. In: 10th Annual ACM Symposium on Theory of Computing, STOC 1978, pp. 216-226. ACM, New York (1978).
22. n/4) algorithm for certain NP-complete problems. SIAM J. Comput. 10(3), 456-464 (1981).
23. Wahlström, M.: Algorithms, measures, and upper bounds for satisfiability and related problems. PhD thesis, Department of Computer and Information Science, Linköping University, Linköping, Sweden (2007).
24. Woeginger, G. J.: Exact algorithms for NP-hard problems: A survey. In: Jünger, M., Reinelt, G., Rinaldi, G. (eds.) 5th International Workshop on Combinatorial Optimization-Eureka, You Shrink! Lecture Notes in Computer Science, vol. 2570, pp. 185-208. Springer, Berlin (2003).