WeChat Mini Program
Old Version Features

    • A Fixed-Parameter Tractable Algorithm for Matrix Domination

    M Weston

    Information Processing Letters（2004）

    Univ Victoria

    Cited 22|Views7
    Abstract
    MATRIX DOMINATION is the NP-complete problem of determining whether a given {0,1} matrix contains a set of k non-zero entries that are in the same row or same column as all other non-zero entries. Using a kernelization and search tree approach, we show the problem to be fixed-parameter tractable with running time O(n3 + 1.959kk5/2).
    More
    Translated text
    Key words
    computational complexity,parameterized complexity,graph algorithms,analysis of algorithms
    PDF
    View via Publisher
    Bibtex
    AI Read Science
    Must-Reading Tree
    Example
    Generate MRT to find the research sequence of this paper
    Data Disclaimer
    The page data are from open Internet sources, cooperative publishers and automatic analysis results through AI technology. We do not make any commitments and guarantees for the validity, accuracy, correctness, reliability, completeness and timeliness of the page data. If you have any questions, please contact us by email: report@aminer.cn
    Chat Paper
    Summary is being generated by the instructions you defined