Algorithms Based on the Treewidth of Sparse Graphs
We prove that given a graph, one can efficiently find a set of no more than m/5.217 + 1 nodes whose removal yields a partial two-tree. As an application, we immediately get simple algorithms for several problems, including Max-Cut, Max-2-SAT and Max-2-XSAT. All of these take a record-breaking time of O *(2 m/5.217), where m is the number of clauses or edges, while only using polynomial space. Moreover, the existence of the aforementioned node sets implies an upper bound of m/5.217 + 3 on the treewidth of a graph with m edges. Letting go of polynomial space restrictions, this can be improved to a bound of m/5.769 + O(log n) on the pathwidth, leading to algorithms for the above problems that take O *(2 m/5.769) time.
Unable to display preview. Download preview PDF.
- 4.Fomin, F.V., Høie, K.: Pathwidth of cubic graphs and exact algorithms. Technical Report 298, Department of Informatics, University of Bergen (May 2005)Google Scholar
- 7.Madsen, B.A., Rossmanith, P.: Maximum exact satisfiability: NP-completeness proofs and exact algorithms. Technical Report RS-04-19, BRICS (October 2004)Google Scholar
- 8.Scott, A., Sorkin, G.B.: Faster algorithms for Max-CUT and Max-CSP, with polynomial expected time for sparse instances. In: Arora, S., Jansen, K., Rolim, J.D.P., Sahai, A. (eds.) RANDOM 2003 and APPROX 2003. LNCS, vol. 2764, pp. 382–395. Springer, Heidelberg (2003)Google Scholar