Pages without language links
Jump to navigation
Jump to search
The following pages do not link to other language versions.
Showing below up to 50 results in range #1,551 to #1,600.
View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)
- Reduction from CNF-SAT to Approximate Diameter
- Reduction from CNF-SAT to Approximate Reach Centrality
- Reduction from CNF-SAT to Dynamic 4/3-Diameter
- Reduction from CNF-SAT to Dynamic Connected Subgraph
- Reduction from CNF-SAT to Dynamic MaxSCC
- Reduction from CNF-SAT to Dynamic ST-Reach
- Reduction from CNF-SAT to Frechet Distance
- Reduction from CNF-SAT to Local Alignment
- Reduction from CNF-SAT to Longest Common Substring with don't cares
- Reduction from CNF-SAT to Multiple Local Alignment
- Reduction from CNF-SAT to Positive Betweenness Centrality
- Reduction from CNF-SAT to SC2
- Reduction from CNF-SAT to constant sensitivity (4/3)-approximate incremental diameter
- Reduction from CNF-SAT to dynamic st-Maximum Flow
- Reduction from CNF-SAT to k-OV
- Reduction from CNF-SAT to sensitive incremental
- Reduction from CNF-SAT to sensitive incremental ST-Reach
- Reduction from Diameter to Approximate Betweenness Centrality
- Reduction from Diameter to Positive Betweenness Centrality
- Reduction from Diameter to Reach Centrality
- Reduction from Directed, Weighted APSP to 1-sensitive decremental diameter
- Reduction from Directed, Weighted APSP to 2-sensitive decremental st-shortest paths
- Reduction from Directed, Weighted APSP to All-Nodes Median Parity
- Reduction from Directed, Weighted APSP to Directed All-Nodes Positive Betweenness Centrality
- Reduction from Directed, Weighted APSP to Directed All-Nodes Reach Centrality
- Reduction from Directed, Weighted APSP to Dynamic $st$-Shortest Path
- Reduction from Directed, Weighted APSP to Dynamic Bipartite Maximum-Weight Matching
- Reduction from Directed, Weighted APSP to Negative Triangle Detection
- Reduction from Directed, Weighted APSP to Replacement Paths Problem (RPP)
- Reduction from Directed, Weighted APSP to Second Shortest Simple Path
- Reduction from Directed, Weighted APSP to Undirected, Weighted APSP
- Reduction from Directed Median to Directed, Weighted APSP
- Reduction from Directed Radius to Directed, Weighted APSP
- Reduction from Distance Product to Second Shortest Simple Path
- Reduction from GeomBase to 3SUM'
- Reduction from GeomBase to Planar Motion Planning
- Reduction from GeomBase to Separator1
- Reduction from GeomBase to Separator2
- Reduction from GeomBase to Strips Cover Box
- Reduction from GeomBase to Visibility Between Segments
- Reduction from GeomBase to Visibility From Infinity
- Reduction from Hole in Union to Triangles Cover Triangle
- Reduction from MAX-CNF-SAT to All-Pairs Maximum Flow
- Reduction from MAX-CNF-SAT to Maximum Local Edge Connectivity
- Reduction from MAX-CNF-SAT to st-Maximum Flow
- Reduction from Matrix Product to Negative Triangle Detection
- Reduction from Max-Weight K-Clique to Maximum Square Subarray
- Reduction from Max-Weight K-Clique to Weighted Depth
- Reduction from Max-Weight k-Clique to Max-Weight Rectangle
- Reduction from Max-Weight k-Clique to Maximum Subarray