Encoding Treewidth into SAT (Q3637156): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Treewidthlib / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-642-02777-2_6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1821762897 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Finding Embeddings in a <i>k</i>-Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experimental and Efficient Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch and Bound Algorithm for Exact, Upper, and Lower Bounds on Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth lower bounds with brambles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contraction and Treewidth Lower Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4426346 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2816028 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. II. Algorithmic aspects of tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards an Optimal CNF Encoding of Boolean Cardinality Constraints / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:57, 1 July 2024

scientific article
Language Label Description Also known as
English
Encoding Treewidth into SAT
scientific article

    Statements

    Identifiers