arXiv (OAI)open access
On the Parameterized Complexity of Grundy Domination and Zero Forcing Problems
computational complexity, discrete mathematics, data structures and algorithms, combinatorics
This document is indexed with metadata only — full text is not available in the archive for this record.
Open the official source ↗Related documents
Record · ID 177117
Conceptio Open Knowledge Archive — every document is proof-bundled with source, license, and retrieval metadata.