Computing and certifying twin-width using logic
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- scientific article; zbMATH DE number 1003286 (Why is no real title available?)
- scientific article; zbMATH DE number 1456953 (Why is no real title available?)
- A SAT approach to clique-width
- A SAT approach to twin-width
- A survey of the algorithmic aspects of modular decomposition
- Bounds for the twin-width of graphs
- Computing optimal hypertree decompositions with SAT
- DRAT-trim: Efficient Checking and Trimming Using Expressive Clausal Proofs
- Deciding first-order properties of nowhere dense graphs
- Deciding twin-width at most 4 is NP-complete
- Efficient CNF encoding of Boolean cardinality constraints
- Encoding Treewidth into SAT
- Faster graph algorithms through DAG compression
- Finding small patterns in permutations in linear time
- PACE solver description: Touiouidth
- PACE solver description: exact (GUTHMI) and heuristic (GUTHM)
- PACE solver description: hydra prime
- PACE solver description: the PACE 2023 parameterized algorithms and computational experiments challenge: twinwidth
- Practical graph isomorphism. II.
- PySAT: a Python toolkit for prototyping with SAT oracles
- SAT-encodings for treecut width and treedepth
- Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
- Transitiv orientierbare Graphen
- Twin-width of subdivisions of multigraphs
- Twin-width. I: Tractable FO model checking
- Twin-width. II: Small classes
- Weighted model counting with twin-width
This page was built for publication: Computing and certifying twin-width using logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6877844)
