A SAT Approach to Clique-Width (Q2946763): Difference between revisions

← Older edit

@@ description / en / description / en @@
-scientific article
+scientific article; zbMATH DE number 6195205
@@ Property / zbMATH Open document ID @@
+.68501
@@ Property / zbMATH Open document ID: 1390.68501 / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/978-3-642-39071-5_24
@@ Property / DOI: 10.1007/978-3-642-39071-5_24 / rank @@
+Normal rank
@@ Property / published in @@
+Theory and Applications of Satisfiability Testing – SAT 2013
+Normal rank
@@ Property / publication date @@
+August 2013Timestamp +2013-08-05T00:00:00Z
Timezone +00:00
Calendar Gregorian
Precision 1 day
Before 0
After 0
-Timestamp
++2013-08-05T00:00:00Z
-Timezone
++00:00
-Calendar
+Gregorian
-Precision
+day
 Before
 After
@@ Property / publication date: 5 August 2013 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+R10
@@ Property / Mathematics Subject Classification ID: 68R10 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C35
@@ Property / Mathematics Subject Classification ID: 05C35 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C70
@@ Property / Mathematics Subject Classification ID: 05C70 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6195205
@@ Property / zbMATH DE Number: 6195205 / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+Lingeling
@@ Property / describes a project that uses: Lingeling / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W1906408003
@@ Property / OpenAlex ID: W1906408003 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2220220931
@@ Property / OpenAlex ID: W2220220931 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.5498
@@ Property / arXiv ID: 1304.5498 / rank @@
+Normal rank
@@ Property / cites work @@
+Linear Rank-Width and Linear Clique-Width of Trees
+Normal rank
@@ Property / cites work @@
+Q5503674
@@ Property / cites work: Q5503674 / rank @@
+Normal rank
@@ Property / cites work @@
+Boolean-width of graphs
@@ Property / cites work: Boolean-width of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial-time recognition of clique-width \(\leq 3\) graphs
+Normal rank
@@ Property / cites work @@
+On the Relationship Between Clique-Width and Treewidth
+Normal rank
@@ Property / cites work @@
+Q4037313
@@ Property / cites work: Q4037313 / rank @@
+Normal rank
@@ Property / cites work @@
+Handle-rewriting hypergraph grammars
@@ Property / cites work: Handle-rewriting hypergraph grammars / rank @@
+Normal rank
@@ Property / cites work @@
+Linear time solvable optimization problems on graphs of bounded clique-width
+Normal rank
@@ Property / cites work @@
+On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic
+Normal rank
@@ Property / cites work @@
+Upper bounds to the clique width of graphs
@@ Property / cites work: Upper bounds to the clique width of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Constrained-path labellings on graphs of bounded clique-width
+Normal rank
@@ Property / cites work @@
+Q4507228
@@ Property / cites work: Q4507228 / rank @@
+Normal rank
@@ Property / cites work @@
+Theory and Applications of Satisfiability Testing
@@ Property / cites work: Theory and Applications of Satisfiability Testing / rank @@
+Normal rank
@@ Property / cites work @@
+Clique-Width is NP-Complete
@@ Property / cites work: Clique-Width is NP-Complete / rank @@
+Normal rank
@@ Property / cites work @@
+Principles and Practice of Constraint Programming – CP 2004
+Normal rank
@@ Property / cites work @@
+ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES
@@ Property / cites work: ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES / rank @@
+Normal rank
@@ Property / cites work @@
+On the relationship between NLC-width and linear NLC-width
+Normal rank
@@ Property / cites work @@
+A survey of the algorithmic aspects of modular decomposition
+Normal rank
@@ Property / cites work @@
+Graphs of linear clique-width at most 3
@@ Property / cites work: Graphs of linear clique-width at most 3 / rank @@
+Normal rank
@@ Property / cites work @@
+Characterising the linear clique-width of a class of graphs by forbidden induced subgraphs
+Normal rank
@@ Property / cites work @@
+Computing the Clique-Width of Large Path Powers in Linear Time via a New Characterisation of Clique-Width
+Normal rank
@@ Property / cites work @@
+Finding Good Decompositions for Dynamic Programming on Dense Graphs
+Normal rank
@@ Property / cites work @@
+Conflict Anticipation in the Search for Graph Automorphisms
+Normal rank
@@ Property / cites work @@
+Empirical Study of the Anatomy of Modern Sat Solvers
+Normal rank
@@ Property / cites work @@
+Q2816028
@@ Property / cites work: Q2816028 / rank @@
+Normal rank
@@ Property / cites work @@
+Rank-width of random graphs
@@ Property / cites work: Rank-width of random graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The relative clique-width of a graph
@@ Property / cites work: The relative clique-width of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating clique-width and branch-width
@@ Property / cites work: Approximating clique-width and branch-width / rank @@
+Normal rank
@@ Property / cites work @@
+Graph-Theoretic Concepts in Computer Science
@@ Property / cites work: Graph-Theoretic Concepts in Computer Science / rank @@
+Normal rank
@@ Property / cites work @@
+Encoding Treewidth into SAT
@@ Property / cites work: Encoding Treewidth into SAT / rank @@
+Normal rank
@@ Property / cites work @@
+Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
+Normal rank
@@ Property / cites work @@
+A combinatorial optimization algorithm for solving the branchwidth problem
+Normal rank
@@ Property / cites work @@
+Compiling finite linear CSP into SAT
@@ Property / cites work: Compiling finite linear CSP into SAT / rank @@
+Normal rank
@@ Property / cites work @@
+New plain-exponential time classes for graph homomorphism
+Normal rank
@@ Property / cites work @@
+Q4473043
@@ Property / cites work: Q4473043 / rank @@
+Normal rank
@@ Property / cites work @@
+\(k\)-NLC graphs and polynomial algorithms
@@ Property / cites work: \(k\)-NLC graphs and polynomial algorithms / rank @@
+Normal rank