On the probe problem for \((r, \ell)\)-well-coveredness: algorithms and complexity (Q2172604)

From MaRDI portal
scientific article
Language Label Description Also known as
English
On the probe problem for \((r, \ell)\)-well-coveredness: algorithms and complexity
scientific article

    Statements

    On the probe problem for \((r, \ell)\)-well-coveredness: algorithms and complexity (English)
    0 references
    0 references
    0 references
    16 September 2022
    0 references
    0 references
    \((r,\ell)\)-graph
    0 references
    probe
    0 references
    recognition
    0 references
    complexity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references