A SAT Approach to Branchwidth (Q2818011): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the Boolean-Width of a Graph: Structure and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Satisfiability, branch-width and Tseitin tautologies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tour Merging via Branch-Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4507228 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing branchwidth via efficient triangulations and blocks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3086928 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A SAT Approach to Clique-Width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs, branchwidth, and tangles! Oh my! / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4430877 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Branch-Decompositions and Rank-Decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Local Search Algorithm for Branchwidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. X: Obstructions to tree-decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Encoding Treewidth into SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Call routing and the ratcatcher / rank
 
Normal rank

Latest revision as of 13:26, 12 July 2024

scientific article
Language Label Description Also known as
English
A SAT Approach to Branchwidth
scientific article

    Statements

    A SAT Approach to Branchwidth (English)
    0 references
    0 references
    0 references
    0 references
    5 September 2016
    0 references
    0 references
    0 references