arXiv (All)
open access
Exact Algorithms for Distance to Unique Vertex Cover
Horiyama et al. (AAAI 2024) studied the problem of generating graph instances that possess a unique minimum vertex cover under specific conditions. Their approach involved pre-assigning certain vertices to be part of the solution or excluding them from it. Notably, for the \textsc{Vertex Cover} prob
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
- Locating-dominating partitions for some classes of graphs#147107
- A Bregman-Sinkhorn Algorithm for the Maximum Weight Independent Set Problem#670289
- Capacitated Partition Vertex Cover and Partition Edge Cover / Rajni Dabas, Samir Khuller, Emilie Rivkin#1188633
- EDiS: Edge Disjoint Subgraph Sparsification Framework for Graph Neural Networks#1233098
- Matching with Multiple Bottlenecks: Parameterized Complexity and Approximation#1202530
Record · ID 1297984
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