New complexity results for the \(k\)-covers problem (Q545371): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q200907
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Costas S. Iliopoulos / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ins.2011.02.009 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2042481350 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal superprimitivity testing for strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal off-line detection of repetitions in a string / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time approximation algorithm for the weighted vertex cover problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast and Practical Algorithms for Computing All the Runs in a String / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5446124 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal algorithm for computing the repetitions in a word / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4820869 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the \(\lambda \)-covers of a string / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Approximation Algorithms for the Vertex Cover Problem in Graphs and Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for the Set Covering and Vertex Cover Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: New complexity results for the \(k\)-covers problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4934345 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the cover array in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Detecting leftmost maximal periodicities / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(n log n) algorithm for finding all repetitions in a string / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast, practical algorithms for computing all the repeats in a string / rank
 
Normal rank
Property / cites work
 
Property / cites work: All Highest Scoring Paths in Weighted Grid Graphs and Their Application to Finding All Approximate Repeats in Strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5506327 / rank
 
Normal rank

Latest revision as of 04:30, 4 July 2024

scientific article
Language Label Description Also known as
English
New complexity results for the \(k\)-covers problem
scientific article

    Statements

    New complexity results for the \(k\)-covers problem (English)
    0 references
    0 references
    0 references
    0 references
    22 June 2011
    0 references
    string cover
    0 references
    regularity
    0 references
    complexity
    0 references
    NP-complete
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references