arXiv (All)
open access
A Deterministic Polynomial Kernel for Odd Cycle Transversal
We give a deterministic polynomial kernel for Odd Cycle Transversal, derandomizing the randomized kernel of Kratsch and Wahlström (TALG 2014). Our algorithm uses a deterministic polynomial-time construction of almost multilinear representations of gammoids. Such a representation assigns a block of c
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
- A note on the generator subgraph of a graph#471108
- Unimodality of Independence Polynomials for Sufficiently Large Forests#1034933
- Clonoids of Boolean functions with a monotone or discriminator source clone#972864
- Universal Non-Gaussian Signatures from Transient Instabilities#662417
- Universal Non-Gaussian Signatures from Transient Instabilities#661367
Record · ID 1077070
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