A SAT Approach to Branchwidth

Lodha, N; Ordyniak, S; Szeider, S

Lodha, N (reprint author), TU Wien, Fac Informat, Algorithms & Complex Grp, Inst Log & Computat, Favoritenstr 9-11,E192-01,Stiege 2,4 Stock, A-1040 Vienna, Austria.

ACM TRANSACTIONS ON COMPUTATIONAL LOGIC, 2019; 20 (3):

Abstract

Branch decomposition is a prominent method for structurally decomposing a graph, a hypergraph, or a propositional formula in conjunctive normal form. ......

Full Text Link