Efficient algorithms on sets of permutations, dominance, and real-weighted APSP
From MaRDI portal
Publication:4633908
Recommendations
- All pairs shortest paths using bridging sets and rectangular matrix multiplication
- More Algorithms for All-Pairs Shortest Paths in Weighted Graphs
- Fast algorithms for the dominating set problem on permutation graphs
- Faster all-pairs shortest paths via circuit complexity
- scientific article; zbMATH DE number 219247
Cited in
(12)- A fast algorithm for multiplying min-sum permutations
- Efficient parameterized algorithms for computing all-pairs shortest paths
- Dominance product and high-dimensional closest pair under \(L_\infty\)
- Fast matrix multiplication and its algebraic neighbourhood
- \((\min ,+)\) matrix and vector products for inputs decomposable into few monotone subsequences
- Hamming Distance Completeness
- Twin-width. III: Max independent set, min dominating set, and coloring
- Truly subcubic algorithms for language edit distance and RNA folding via fast bounded-difference min-plus product
- Fredman's trick meets dominance product: fine-grained complexity of unweighted APSP, 3SUM counting, and more
- Brief announcement: Hamming distance completeness and sparse matrix multiplication
- Remarks on ‘equivalence of stability concepts for discrete time-varying systems’
- Design and Analysis of a Tree-Backtracking Algorithm for Multiset and Pure Permutations
This page was built for publication: Efficient algorithms on sets of permutations, dominance, and real-weighted APSP
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4633908)
