A faster algorithm for finding minimum Tucker submatrices (Q693064)

From MaRDI portal
Revision as of 23:54, 5 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A faster algorithm for finding minimum Tucker submatrices
scientific article

    Statements

    title
    A faster algorithm for finding minimum Tucker submatrices (English)
    0 references
    author
    Guillaume Blin
    0 references
    Romeo Rizzi
    0 references
    Stéphane Vialette
    0 references
    publication date
    7 December 2012
    0 references
    Mathematics Subject Classification ID
    92-08
    0 references
    92C40
    0 references
    68W99
    0 references
    68W40
    0 references
    zbMATH DE Number
    6113704
    0 references
    zbMATH Keywords
    consecutive ones property
    0 references
    Tucker configurations
    0 references
    OpenAlex ID
    W2030520663
    0 references
    cites work
    Q3128911
    0 references
    Q3840361
    0 references
    Q3397627
    0 references
    Q5501338
    0 references
    Q2917411
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q693064&oldid=35311603"
    Powered by MediaWiki