arXiv (All)
open access
A simple algorithm for computing Hamilton paths on independent set polytopes
The independent set polytope, or stable set polytope, of a graph $G$ is the 0/1-polytope defined by the convex hull of the characteristic vectors of all independent sets of $G$. We present a simple algorithm for computing a Hamilton path on the independent set polytope of a given $n$-vertex graph $G
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
- Learning Polyhedral Conformal Sets for Robust Optimization#973165
- On Correspondences between the Alexander Polynomials of Special Alternating Links and MOY Graphs#1084730
- An Alexander Polynomial Refinement for Alternating Links, with Trapezoidal Properties#792486
- An Alexander Polynomial Refinement for Alternating Links, with Trapezoidal Properties#788486
- Bounded joins of biclosed sets#1063464
Record · ID 975354
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