arXiv (All)
open access
Subquadratic-Query Algorithms for Finding Another Maximum Matroid Intersection
Let $\mathcal{M}_1,\mathcal{M}_2$ be two matroids on a common ground set $V$, given by independence oracles, and let $S$ be a maximum-cardinality common independent set. We study the problem of deciding whether there exists another maximum common independent set $T\ne S$, and of outputting one when
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
- Counting $t$-wise $L$-intersecting cliques with prescribed intersection sizes#1037076
- Extremal Spanning Trees in Product Grid Graphs#1117479
- A Network Formation Game for Katz Centrality Maximization: A Resource Allocation Perspective#1048320
- Covering Arrays of Strength Three#921555
- Approximate Pareto Frontiers for Submodular Utility and Cost Tradeoffs#987592
Record · ID 1011893
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