New pages
Jump to navigation
Jump to search
(newest | oldest) View (newer 50 | older 50) (20 | 50 | 100 | 250 | 500)
- 10:18, 15 February 2023 Boolean Matrix Multiplication (Combinatorial) (hist | edit) [2,533 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Boolean Matrix Multiplication (Combinatorial) (Matrix Product)}} == Description == Matrix multiplication of two boolean matrices (i.e. where all entries are in $F_2$ and addition is mod 2). Here, only "combinatorial" algorithms are considered. == Related Problems == Generalizations: Boolean Matrix Multiplication Related: Matrix Multiplication, Matrix Product Verification, Distance Product, $(\min, \leq)$ Product == Parameters ==...")
- 10:18, 15 February 2023 Boolean Matrix Multiplication (hist | edit) [7,916 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Boolean Matrix Multiplication (Matrix Product)}} == Description == Matrix multiplication of two boolean matrices (i.e. where all entries are in $F_2$ and addition is mod 2) == Related Problems == Generalizations: Matrix Multiplication Subproblem: Boolean Matrix Multiplication (Combinatorial) Related: Matrix Product Verification, Distance Product, $(\min, \leq)$ Product == Parameters == <pre>n: dimension of square matrix</pre>...")
- 10:18, 15 February 2023 Maximum Local Edge Connectivity (hist | edit) [6,062 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Maximum Local Edge Connectivity (Maximum Flow)}} == Description == Find the pair of nodes with the maximum number of edge-disjoint paths between them == Related Problems == Related: st-Maximum Flow, Integer Maximum Flow, Unweighted Maximum Flow, Non-integer Maximum Flow, Minimum-Cost Flow, All-Pairs Maximum Flow == Parameters == <pre>V: number of vertices E: number of edges</pre> == Table of Algorithms == {| class="wikita...")
- 10:18, 15 February 2023 All-Pairs Maximum Flow (hist | edit) [6,440 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:All-Pairs Maximum Flow (Maximum Flow)}} == Description == Find the maximum flow between all pairs of nodes == Related Problems == Related: st-Maximum Flow, Integer Maximum Flow, Unweighted Maximum Flow, Non-integer Maximum Flow, Minimum-Cost Flow, Maximum Local Edge Connectivity == Parameters == <pre>V: number of vertices E: number of edges</pre> == Table of Algorithms == {| class="wikitable sortable" style="text-align:c...")
- 10:18, 15 February 2023 Minimum-Cost Flow (hist | edit) [5,740 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Minimum-Cost Flow (Maximum Flow)}} == Description == Maximum flow problems involve finding a feasible flow through a flow network that is maximum. In this variant, each edge is given a cost coefficient, and we wish to minimize total cost while reaching a threshold flow. == Related Problems == Related: st-Maximum Flow, Integer Maximum Flow, Unweighted Maximum Flow, Non-integer Maximum Flow, All-Pairs Maximum Flow, Maximum Local Ed...")
- 10:18, 15 February 2023 Non-integer Maximum Flow (hist | edit) [5,591 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Non-integer Maximum Flow (Maximum Flow)}} == Description == Maximum flow problems involve finding a feasible flow through a flow network that is maximum. In this variant, the capacities may be non-integers. == Related Problems == Subproblem: Integer Maximum Flow Related: st-Maximum Flow, Unweighted Maximum Flow, Minimum-Cost Flow, All-Pairs Maximum Flow, Maximum Local Edge Connectivity == Parameters == <pre>V: number of ver...")
- 10:18, 15 February 2023 Unweighted Maximum Flow (hist | edit) [5,622 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Unweighted Maximum Flow (Maximum Flow)}} == Description == Maximum flow problems involve finding a feasible flow through a flow network that is maximum. In this variant, all edges have unit weight. == Related Problems == Generalizations: Integer Maximum Flow Related: st-Maximum Flow, Non-integer Maximum Flow, Minimum-Cost Flow, All-Pairs Maximum Flow, Maximum Local Edge Connectivity == Parameters == <pre>V: number of vertic...")
- 10:18, 15 February 2023 Integer Maximum Flow (hist | edit) [6,683 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Integer Maximum Flow (Maximum Flow)}} == Description == Maximum flow problems involve finding a feasible flow through a flow network that is maximum. In this variant, the capacities must be integers. == Related Problems == Generalizations: Non-Integer Maximum Flow Subproblem: Unweighted Maximum Flow Related: st-Maximum Flow, Non-integer Maximum Flow, Minimum-Cost Flow, All-Pairs Maximum Flow, Maximum Local Edge Connectivity...")
- 10:18, 15 February 2023 St-Maximum Flow (hist | edit) [7,829 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:st-Maximum Flow (Maximum Flow)}} == Description == Find the maximum flow from $s$ to $t$ == Related Problems == Related: Integer Maximum Flow, Unweighted Maximum Flow, Non-integer Maximum Flow, Minimum-Cost Flow, All-Pairs Maximum Flow, Maximum Local Edge Connectivity == Parameters == <pre>V: number of vertices E: number of edges U: maximum edge capacity</pre> == Table of Algorithms == {| class="wikitable sortable" style...")
- 10:18, 15 February 2023 Longest Common Substring with don't cares (hist | edit) [1,356 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Longest Common Substring with don't cares (Longest Common Subsequence)}} == Description == Find the length of the longest common substring of two strings S and T, where S is a binary string and T is is a binary string and additional * characters that can match either 0 or 1. == Related Problems == Generalizations: Longest Common Subsequence == Parameters == <pre>$n$: length of the longer input string $m$: length of the shorter input string $r$:...")
- 10:18, 15 February 2023 Longest Common Subsequence (hist | edit) [1,377 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Longest Common Subsequence (Longest Common Subsequence)}} == Description == The longest common subsequence (LCS) problem is the problem of finding the longest subsequence common to all sequences in a set of sequences (often just two sequences). == Related Problems == Subproblem: Longest Common Substring with don't cares == Parameters == <pre>$n$: length of the longer input string $m$: length of the shorter input string $r$: length of the LCS $s...")
- 10:17, 15 February 2023 Approximate MCSP (hist | edit) [1,377 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Approximate MCSP (Matrix Chain Multiplication)}} == Description == The Matrix Chain Scheduling Problem (or MCSP) is an optimization problem� where the goal is to find the product sequence for evaluating a chain of matrix products and the processor schedule for the sequence such that the evaluation time is minimized on a parallel system. In the approximation problem, the matrix multiplication carried out with the output result will use a number of opera...")
- 10:17, 15 February 2023 Matrix Chain Scheduling Problem (hist | edit) [1,194 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Matrix Chain Scheduling Problem (Matrix Chain Multiplication)}} == Description == The Matrix Chain Scheduling Problem (or MCSP) is an optimization problem� where the goal is to find the product sequence for evaluating a chain of matrix products and the processor schedule for the sequence such that the evaluation time is minimized on a parallel system. == Related Problems == Generalizations: Matrix Chain Ordering Problem Subproblem: Approximat...")
- 10:17, 15 February 2023 Approximate MCOP (hist | edit) [2,012 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Approximate MCOP (Matrix Chain Multiplication)}} == Description == Matrix chain multiplication (or Matrix Chain Ordering Problem; MCOP) is an optimization problem. Given a sequence of matrices, the goal is to find the most efficient way to multiply these matrices. In the approximation problem, the matrix multiplication carried out with the output result will use a number of operations that has some sort of upper bound based on the optimal solution. == R...")
- 10:17, 15 February 2023 Matrix Chain Ordering Problem (hist | edit) [1,541 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Matrix Chain Ordering Problem (Matrix Chain Multiplication)}} == Description == Matrix chain multiplication (or Matrix Chain Ordering Problem; MCOP) is an optimization problem. Given a sequence of matrices, the goal is to find the most efficient way to multiply these matrices. == Related Problems == Subproblem: Approximate MCOP, Matrix Chain Scheduling Problem Related: Matrix Chain Scheduling Problem, Approximate MCSP == Parameters...")
- 10:17, 15 February 2023 Kth Order Statistic (hist | edit) [1,166 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:kth Order Statistic (kth Order Statistic)}} == Description == An algorithm seeks to find the $k^{th}$ order statistic of a statistical sample, or the $k^{th}$-smallest value in a list or array. == Parameters == <pre>n: size of list</pre> == Table of Algorithms == {| class="wikitable sortable" style="text-align:center;" width="100%" ! Name !! Year !! Time !! Space !! Approximation Factor !! Model !! Reference |- | Naive Selection (kth Order St...")
- 10:17, 15 February 2023 Non-Comparison Sorting (hist | edit) [2,528 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Non-Comparison Sorting (Sorting)}} == Description == A sorting algorithm is an algorithm that puts elements of a list in a certain order, not using comparisons between elements (so elements are typically integers or real numbers). == Related Problems == Generalizations: Sorting Related: Comparison Sorting == Parameters == <pre>n: size of list</pre> == Table of Algorithms == {| class="wikitable sortable" style="text-align:center;" width...")
- 10:17, 15 February 2023 Comparison Sorting (hist | edit) [5,958 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Comparison Sorting (Sorting)}} == Description == A sorting algorithm is an algorithm that puts elements of a list in a certain order, using comparisons between elements. == Related Problems == Generalizations: Sorting Related: Non-Comparison Sorting == Parameters == <pre>n: size of list</pre> == Table of Algorithms == {| class="wikitable sortable" style="text-align:center;" width="100%" ! Name !! Year !! Time !! Space !! Approximation...")
- 10:17, 15 February 2023 Sorting (hist | edit) [5,924 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Sorting (Sorting)}} == Description == A sorting algorithm is an algorithm that puts elements of a list in a certain order == Related Problems == Subproblem: Comparison Sorting, Non-Comparison Sorting Related: Non-Comparison Sorting == Parameters == <pre>n: size of list</pre> == Table of Algorithms == Currently no algorithms in our database for the given problem. == Time Complexity graph == 1000px ==...")
- 10:17, 15 February 2023 Family:3SUM (hist | edit) [193 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:3SUM}}== Description == Currently no description in our database for the given family. == Problems Variations == * 3SUM * 3SUM' * All-Integers 3SUM * Real 3SUM")
- 10:17, 15 February 2023 Family:Dihedral Rotation Queries (hist | edit) [230 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Dihedral Rotation Queries}}== Description == Currently no description in our database for the given family. == Problems Variations == * Dynamic Dihedral Rotation Queries * Static Dihedral Rotation Queries")
- 10:17, 15 February 2023 Family:Model-Checking Problem (hist | edit) [510 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Model-Checking Problem}}== Description == Currently no description in our database for the given family. == Problems Variations == * Conjunctive Reachability Queries in MDPs * Conjunctive Safety Queries in MDPs * Disjunctive Queries of Safety in Graphs * Disjunctive Reachability Queries in MDPs * Disjunctive Safety Queries in MDPs * Disjunctive coBüchi Objectives * Generalized Büchi Games * Reachability in MDPs * Safe...")
- 10:17, 15 February 2023 Family:Vertex Reachability (hist | edit) [360 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Vertex Reachability}}== Description == Currently no description in our database for the given family. == Problems Variations == * #SSR * 1-sensitive incremental ss-reach * 2-sensitive incremental st-reach * ST-Reach * ap-reach * constant sensitivity incremental ST-Reach * sensitive incremental #SSR * st-Reach")
- 10:17, 15 February 2023 Family:Matrix-Vector Multiplication (hist | edit) [245 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Matrix-Vector Multiplication}}== Description == Currently no description in our database for the given family. == Problems Variations == * Online Matrix-Vector Multiplication * Online Vector-Matrix-Vector Multiplication")
- 10:17, 15 February 2023 Family:Graph Cycles (hist | edit) [182 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Graph Cycles}}== Description == Currently no description in our database for the given family. == Problems Variations == * Shortest Cycle * Shortest k-Cycle")
- 10:17, 15 February 2023 Family:Minimum Witness (hist | edit) [203 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Minimum Witness}}== Description == Currently no description in our database for the given family. == Problems Variations == * All Pairs Minimum Witness * Minimum Witness Finding")
- 10:17, 15 February 2023 Family:Local Alignment (hist | edit) [194 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Local Alignment}}== Description == Currently no description in our database for the given family. == Problems Variations == * Local Alignment * Multiple Local Alignment")
- 10:17, 15 February 2023 Family:Motion Planning Problems (hist | edit) [204 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Motion Planning Problems}}== Description == Currently no description in our database for the given family. == Problems Variations == * 3D Motion Planning * Planar Motion Planning")
- 10:17, 15 February 2023 Family:Geometric Visibility Problems (hist | edit) [243 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Geometric Visibility Problems}}== Description == Currently no description in our database for the given family. == Problems Variations == * Visibility Between Segments * Visibility From Infinity * Visible Triangle")
- 10:17, 15 February 2023 Family:Geometric Covering Problems (hist | edit) [319 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Geometric Covering Problems}}== Description == Currently no description in our database for the given family. == Problems Variations == * Hole in Union * Max-Weight Rectangle * Point Covering * Strips Cover Box * Triangle Measure * Triangles Cover Triangle * Weighted Depth")
- 10:17, 15 February 2023 Family:Geometric Separator Problems (hist | edit) [188 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Geometric Separator Problems}}== Description == Currently no description in our database for the given family. == Problems Variations == * Separator1 * Separator2")
- 10:17, 15 February 2023 Family:Geometric Incidence Problems (hist | edit) [200 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Geometric Incidence Problems}}== Description == Currently no description in our database for the given family. == Problems Variations == * 3 Points on Line * Point on 3 Lines")
- 10:17, 15 February 2023 Family:Graph Triangle Problems (hist | edit) [385 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Graph Triangle Problems}}== Description == Currently no description in our database for the given family. == Problems Variations == * Minimum Triangle * Negative Triangle Detection * Negative Triangle Listing * Negative Triangle Search * Nondecreasing Triangle * Triangle Collection* * Triangle Detection * Triangle in Unweighted Graph")
- 10:17, 15 February 2023 Family:Vertex Centrality (hist | edit) [560 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Vertex Centrality}}== Description == Currently no description in our database for the given family. == Problems Variations == * All-Nodes Median Parity * Approximate Betweenness Centrality * Approximate Reach Centrality * Betweenness Centrality * Directed All-Nodes Positive Betweenness Centrality * Directed All-Nodes Reach Centrality * Eccentricity * Positive Betweenness Centrality * Reach Centrality * Undirected Al...")
- 10:17, 15 February 2023 Family:Graph Metrics (hist | edit) [501 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Graph Metrics}}== Description == Currently no description in our database for the given family. == Problems Variations == * 1-sensitive (4/3)-approximate decremental diameter * 1-sensitive (4/3)-approximate decremental eccentricity * 1-sensitive decremental diameter * Approximate Diameter * Decremental Diameter * Diameter * Diameter 2 vs 3 * Diameter 3 vs 7 * Median * Radius * constant sensitivity (4/3)-approxim...")
- 10:17, 15 February 2023 Family:Orthogonal Vectors (hist | edit) [195 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Orthogonal Vectors}}== Description == Currently no description in our database for the given family. == Problems Variations == * 3-OV * OV * Unbalanced OV * k-OV")
- 10:17, 15 February 2023 Family:Boolean Satisfiability (hist | edit) [577 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Boolean Satisfiability}}== Description == Currently no description in our database for the given family. == Problems Variations == * 1-in-3SAT * 2SAT * 3SAT * 3SAT-5 * 4SAT * All-Equal-SAT * Conjunctive Normal Form SAT * Disjunctive Normal Form SAT * Dual-Horn SAT * Horn SAT * MaxSAT * Monotone 1-in-3SAT * Monotone 3SAT * Monotone Not-All-Equal 3-SAT (Monotone NAE 3SAT) * Monotone Not-Exactly-1-i...")
- 10:17, 15 February 2023 Family:Graph Coloring (hist | edit) [398 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Graph Coloring}}== Description == Currently no description in our database for the given family. == Problems Variations == * #2-Graph Coloring * #3-Graph Coloring * #4-Graph Coloring * #5-Graph Coloring * #k-Graph Coloring * 2-Graph Coloring * 3-Graph Coloring * 4-Graph Coloring * 5-Graph Coloring * Chromatic Number * k-Graph Coloring")
- 10:16, 15 February 2023 Family:Recovery (hist | edit) [178 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Recovery}}== Description == Currently no description in our database for the given family. == Problems Variations == * No-Steal/Force * Steal/No-Force")
- 10:16, 15 February 2023 Family:Page Replacements (hist | edit) [170 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Page Replacements}}== Description == Currently no description in our database for the given family. == Problems Variations == * Offline * Online")
- 10:16, 15 February 2023 Family:Deadlock Avoidance (hist | edit) [203 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Deadlock Avoidance}}== Description == Currently no description in our database for the given family. == Problems Variations == * Deadlock Avoidance * Dining Philosophers Problem")
- 10:16, 15 February 2023 Family:Interval Scheduling (hist | edit) [288 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Interval Scheduling}}== Description == Currently no description in our database for the given family. == Problems Variations == * Unweighted Interval Scheduling * Weighted Interval Schedule Maximization Problem (ISMP)")
- 10:16, 15 February 2023 Family:One-Way Hash Functions (hist | edit) [204 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:One-Way Hash Functions}}== Description == Currently no description in our database for the given family. == Problems Variations == * Keyed Hash Functions * Unkeyed Hash Functions")
- 10:16, 15 February 2023 Family:Integral Equations (hist | edit) [194 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Integral Equations}}== Description == Currently no description in our database for the given family. == Problems Variations == * Fredholm Equations * Volterra Equations")
- 10:16, 15 February 2023 Family:Median String Problem (hist | edit) [301 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Median String Problem}}== Description == Currently no description in our database for the given family. == Problems Variations == * Median String Problem with Binary Alphabets * Median String Problem with Bounded Alphabets * Median String Problem with Unbounded Alphabets")
- 10:16, 15 February 2023 Family:n-Queens Problem (hist | edit) [222 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:n-Queens Problem}}== Description == Currently no description in our database for the given family. == Problems Variations == * Constructing Solutions * Counting Solutions * n-Queens Completion")
- 10:16, 15 February 2023 Family:Integer Relation (hist | edit) [215 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Integer Relation}}== Description == Currently no description in our database for the given family. == Problems Variations == * Integer Relation Among Integers * Integer Relation Among Reals")
- 10:16, 15 February 2023 Family:Wiener Index (hist | edit) [207 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Wiener Index}}== Description == Currently no description in our database for the given family. == Problems Variations == * Minimum Wiener Connector Problem * Undirected Wiener Index")
- 10:16, 15 February 2023 Family:Texture Mapping (hist | edit) [218 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Texture Mapping}}== Description == Currently no description in our database for the given family. == Problems Variations == * Diffuse Reflection * Environment Mapping * Specular Reflection")
- 10:15, 15 February 2023 Family:Link Analysis (hist | edit) [183 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Link Analysis}}== Description == Currently no description in our database for the given family. == Problems Variations == * InDegree Analysis * Link Analysis")
