arXiv (All)
open access
Compact Partial Symmetry Breaking for Graph Search Problems
Symmetry breaking in graph search problems remains challenging: complete symmetry breaking constraints are typically exponential in size, while partial approaches trade precision for scalability. We introduce a strength-driven, redundancy-aware methodology for constructing compact partial symmetry b
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
- Safe Hypergraph Contraction via Capacity-Aware Repair Certificates#1156949
- Distributed Lower Bounds via Automatic Self-Reduction#1129011
- Distributed Lower Bounds via Automatic Self-Reduction#1108707
- Expansion Counts under Standard A* Tie-Breaking Strategies on the Final Plateau#1049036
- Multilevel iterated tabu search for the multi-constraint graph partitioning problem#231626
Record · ID 1035952
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