A fast algorithm for multiplying min-sum permutations (Q411869): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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.dam.2011.06.022 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2078611081 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3439674 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for a special case of disjoint set union / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Common Substring Alignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-local longest common subsequences in subquadratic time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-local string comparison: algorithmic techniques and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417707 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 03:54, 5 July 2024

scientific article
Language Label Description Also known as
English
A fast algorithm for multiplying min-sum permutations
scientific article

    Statements

    A fast algorithm for multiplying min-sum permutations (English)
    0 references
    0 references
    30 April 2012
    0 references
    algorithms
    0 references
    semi-local string comparison
    0 references
    matrix multiplication
    0 references

    Identifiers