Munich Personal RePEc Archive
metadata only
No advantageous merging in minimum cost spanning tree problems
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
- The Undirected m -Peripatetic Salesman Problem: Polyhedral Results and New Algorithms#676846
- Geometric Folding Algorithms: Linkages, Origami, Polyhedra#3215
- A proof of the maximum Laplacian energy conjecture for connected graphs via a sharp eigenvalue-sum bound#974019
- Improved lower bounds on the maximum size of graphs with girth 5#1061619
- Rainbow Turán numbers for paths of length four#1142774
Record · ID 499786
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