arXiv (All)
open access
Parameterized Enumeration of Minimal Defensive Alliances
In this paper, we consider the complexity of enumerating inclusion minimal defensive alliances. We present a polynomial-delay algorithm on graphs with maximum degree 5. We complement this result by proving that there is no output-polynomial algorithm on bipartite graphs with maximum degree 6 and deg
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
- ALMOST PERFECT MATRICES AND GRAPHS#941673
- Characterization of Some Graphs Realizing Regularity Bounds for Binomial Edge Ideals#1143680
- Adaptive Strategies for GR(1) Games#792400
- Adaptive Strategies for GR(1) Games#788400
- On $k$-limited domination: complexity and Cartesian products#1156397
Record · ID 1064528
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