The Complexity of Computing Minimal Unidirectional Covering Sets (Q3563011)

From MaRDI portal
Revision as of 12:45, 29 April 2024 by EloiFerrer (talk | contribs) (‎Changed label, description and/or aliases in en, and other parts)

Item:Q3563011
scientific article; zbMATH DE number 5713750
Language Label Description Also known as
English
The Complexity of Computing Minimal Unidirectional Covering Sets
scientific article; zbMATH DE number 5713750

    Statements

    The Complexity of Computing Minimal Unidirectional Covering Sets (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    28 May 2010
    0 references

    Identifiers