UNF Digital Commons
metadata only
Implementation of algorithms for sorting by strip swaps using alternating cycle graphs
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
- Conjugating full cycles by adjacent transpositions: diameter and sorting time#925898
- Dense Interprocedural Dominance in Acyclic Graphs: Context Bounds and Compact Queries#1064362
- Shortest undirected paths in de Bruijn Graphs#1136734
- NP-Hardness and a Fixed-Parameter Algorithm for Translocation Distance#1012583
- GraphAlignCoder: Aligning Program and Proof Graphs for Code Generation#448005
Record · ID 310057
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