arXiv (All)
open access
Geometric Graph Representations via Compact SAT Encodings
combinatoricscomputational-geometrydata-structures-and-algorithmsdiscrete-mathematicslogic-in-computer-science
We present compact SAT encodings and certifying exact solvers for boxicity and cubicity. The boxicity of a graph is the minimum dimension in which it is the intersection graph of axis-aligned boxes; cubicity is defined analogously using unit cubes. Grid-based formulations face a geometric discretiza
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- A note on generating polyhedra and quadrangulations#1034603
- Lipschitz-inspired HALRECT Algorithm for Derivative-free Global Optimization#986063
- An Improved Lower Bound for Packing 203 Equal Spheres in a Unit Cube#1324579
- Polyhedral Methods for Cooperative Games: Small Lifts and Hard Faces#1051003
- A Heterarchical Program for Recognition of Polyhedra#239448
Record · ID 1357896
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive