arXiv (All)
open access
Vertex Ordering for Exact Triangle Listing: Concave Geometry and Certified Rounding
Exact forward triangle listers orient each edge of a graph by a vertex order. The order does not change the output, but it changes the work. For the adaptive lister, which scans the smaller of the two forward neighborhoods, the number of candidate tests is a known sum of minima of forward degrees, 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
- Efficient Learning of Balanced Signed Graphs via Sparse Linear Programming#819229
- Efficient Learning of Balanced Signed Graphs via Sparse Linear Programming#809237
- On the algorithmic complexity of twelve covering and independence parameters of graphs#652635
- Graph theory with applications to engineering and computer science#1332055
- cem: Coarsened Exact Matching in Stata#485630
Record · ID 1388880
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