arXiv (All)
open access
Maximum Matching-Match: Hardness and Approximation
In this paper, we study \textsc{MaxMMP}, an optimization variant of the Matching-Match Puzzle introduced by Iburi and Uehara (FUN 2024). Given a graph, a partial vertex coloring, and a multiset of colored sticks, the goal is to complete the coloring and assign the sticks to graph edges so as to maxi
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
- On the Equivalence of the Graph-Structural and Optimization-Based Characterizations of Popular Matchings#798627
- On the Equivalence of the Graph-Structural and Optimization-Based Characterizations of Popular Matchings#797214
- Majority C-coloring in Cartesian products#780968
- Majority C-coloring in Cartesian products#779593
- Genetic Algorithm for Graph Colouring: Exploration of Galinier and Hao's algorithm#824270
Record · ID 975248
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