Sciweavers

    IJFCS
    2006
    70views more  IJFCS 2006»
    The Computational Complexity of Avoiding Forbidden Submatrices by Row Deletions
    15 years 2 months ago
    The Computational Complexity of Avoiding Forbidden Submatrices by Row Deletions
    Download  theinf1.informatik.uni-jena.de
    We initiate a systematic study of the Row Deletion(B) problem on matrices: Given an input matrix A and a fixed "forbidden submatrix" B, the task is to remove a minimum n...
    Sebastian Wernicke, Jochen Alber, Jens Gramm, Jion...
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    i2PDF i2Img i2Text i2OCR i2Symbol i2Type i2Speak i2Style i2Arabic i2Bopomo Latex Equation Editor
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2026, USA.