scientific article; zbMATH DE number 6297786
From MaRDI portal
Publication:5417707
zbMath1288.68303MaRDI QIDQ5417707
Publication date: 22 May 2014
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Positive matrices and their generalizations; cones of matrices (15B48) Numerical linear algebra (65F99) Algorithms on strings (68W32)
Related Items
A faster reduction of the dynamic time warping distance to the longest increasing subsequence length ⋮ A Faster Algorithm for Maximum Induced Matchings on Circle Graphs ⋮ A fast algorithm for multiplying min-sum permutations ⋮ Unified compression-based acceleration of edit-distance computation ⋮ Monge properties of sequence alignment ⋮ Efficient all path score computations on grid graphs ⋮ On totally positive matrices and geometric incidences ⋮ A Maximum Weight Clique Algorithm For Dense Circle Graphs With Many Shared Endpoints ⋮ Towards Approximate Matching in Compressed Strings: Local Subsequence Recognition ⋮ Four-point conditions for the TSP: the complete complexity classification ⋮ Fast distance multiplication of unit-Monge matrices
This page was built for publication:
