Abstract
We consider the Partition Into Triangles problem on bounded degree graphs. We show that this problem is polynomial time solvable on graphs of maximum degree three by giving a linear time algorithm. We also show that this problem becomes \(\mathcal{NP}\)-complete on graphs of maximum degree four. Moreover, we show that there is no subexponential time algorithm for this problem on maximum degree four graphs unless the Exponential Time Hypothesis fails. However, the partition into triangles problem for graphs of maximum degree at most four is in many cases practically solvable as we give an algorithm for this problem that runs in \({\mathcal{O}}(1.02220^n)\) time and linear space. In this extended abstract, we will only give an \({\mathcal{O}}(1.02445^n)\) time algorithm.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Björklund, A.: Exact covers via determinants. In: Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science, STACS 2010 (2010) (to appear)
Björklund, A., Husfeldt, T., Koivisto, M.: Set partitioning via inclusion-exclusion. SIAM Journal of Computing 39(2), 546–563 (2009)
Byskov, J.M., Madsen, B.A., Skjernaa, B.: New algorithms for exact satisfiability. Theoretical Computer Science 332(1-3), 515–541 (2005)
Garey, M.R., Johnson, D.S.: Computers and Intractability, A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York (1979)
Impagliazzo, R., Paturi, R., Zane, F.: Which problems have strongly exponential complexity? Journal of Computer and System Sciences 63(4), 512–530 (2001)
Kann, V.: Maximum bounded 3-dimensional matching is MAX SNP-complete. Information Processing Letters 37(1), 27–35 (1991)
Koivisto, M.: Partitioning into sets of bounded cardinality. In: Chen, J., Fomin, F.V. (eds.) IWPEC 2009. LNCS, vol. 5917, pp. 258–263. Springer, Heidelberg (2009)
Lipton, R.J.: Gödel’s lost letter and P=NP, fast exponential algorithms. Weblog, http://rjlipton.wordpress.com/2009/02/13/polynomial-vs-exponential-time/
Schaefer, T.J.: The complexity of satisfiability problems. In: Proceedings of the 10th Annual ACM Symposium on Theory of Computing, STOC 1978, pp. 216–226 (1978)
van Rooij, J.M.M., van Kooten Niekerk, M.E., Bodlaender, H.L.: Partitioning sparse graphs into triangles: Relations to exact satisfiability and very fast exponential time algorithms. Technical Report UU-CS-2010-005, Department of Information and Computing Sciences, Utrecht University (2010)
Wahlström, M.: Algorithms, measures, and upper bounds for satisfiability and related problems. PhD thesis, Linköping University (2007)
Woeginger, G.J.: Exact algorithms for NP-hard problems: A survey. In: Jünger, M., Reinelt, G., Rinaldi, G. (eds.) Combinatorial Optimization - Eureka, You Shrink! LNCS, vol. 2570, pp. 185–207. Springer, Heidelberg (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
van Rooij, J.M.M., van Kooten Niekerk, M.E., Bodlaender, H.L. (2011). Partition into Triangles on Bounded Degree Graphs. In: Černá, I., et al. SOFSEM 2011: Theory and Practice of Computer Science. SOFSEM 2011. Lecture Notes in Computer Science, vol 6543. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-18381-2_46
Download citation
DOI: https://doi.org/10.1007/978-3-642-18381-2_46
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-18380-5
Online ISBN: 978-3-642-18381-2
eBook Packages: Computer ScienceComputer Science (R0)