arXiv (All)
open access
Independent Set Discovery on Biclique-Free Graphs Is Fixed-Parameter Tractable
\textnormal{\textsc{Independent Set Discovery}} asks whether a configuration of $k$ tokens on distinct vertices can be transformed into an independent $k$-set by a sequence of token slides, each moving one token to an unoccupied neighbor; only the terminal configuration must be independent. \textnor
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
- Independent natural extension for choice functions#84673
- Tree-independence number of $P_5$-free graphs with no large bicliques#1035482
- Computing the Helly Number, Radon Number and Rank in Cycle Convexity#1119309
- Independence Day?#750829
- Independent Natural Extension for Choice Functions#745892
Record · ID 1064381
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