All public logs

Combined display of all available logs of Algorithm Wiki. You can narrow down the view by selecting a log type, the username (case-sensitive), or the affected page (also case-sensitive).

(newest | oldest) View (newer 50 | older 50) (20 | 50 | 100 | 250 | 500)

• 10:18, 15 February 2023 Admin talk contribs created page Minimum-Cost Flow (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 Admin talk contribs created page Non-integer Maximum Flow (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 Admin talk contribs created page Unweighted Maximum Flow (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 Admin talk contribs created page Integer Maximum Flow (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 Admin talk contribs created page St-Maximum Flow (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 Admin talk contribs created page Longest Common Substring with don't cares (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 Admin talk contribs created page LCS (Redirected page to Longest Common Subsequence) Tag: New redirect
• 10:18, 15 February 2023 Admin talk contribs created page Longest Common Subsequence (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 Admin talk contribs created page Approximate MCSP (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 Admin talk contribs created page MCSP (Redirected page to Matrix Chain Scheduling Problem) Tag: New redirect
• 10:17, 15 February 2023 Admin talk contribs created page Matrix Chain Scheduling Problem (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 Admin talk contribs created page Approximate MCOP (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 Admin talk contribs created page MCOP (Redirected page to Matrix Chain Ordering Problem) Tag: New redirect
• 10:17, 15 February 2023 Admin talk contribs created page Matrix Chain Ordering Problem (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 Admin talk contribs created page Kth Order Statistic (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 Admin talk contribs created page Non-Comparison Sorting (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 Admin talk contribs created page Comparison Sorting (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 Admin talk contribs created page Sorting (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 Admin talk contribs created page Family:3SUM (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 Admin talk contribs created page Family:Support Vector Machines (SVM) (Redirected page to Approximate Hard-Margin SVM) Tag: New redirect
• 10:17, 15 February 2023 Admin talk contribs created page Family:Bichromatic Hamming Close Pair (Redirected page to Bichromatic Hamming Close Pair) Tag: New redirect
• 10:17, 15 February 2023 Admin talk contribs created page Family:Dihedral Rotation Queries (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 Admin talk contribs created page Family:Model-Checking Problem (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 Admin talk contribs created page Family:Maximum Inner Product Search (Redirected page to Maximum Inner Product Search) Tag: New redirect
• 10:17, 15 February 2023 Admin talk contribs created page Family:RNA Folding (Redirected page to RNA Folding) Tag: New redirect
• 10:17, 15 February 2023 Admin talk contribs created page Family:Vertex Reachability (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 Admin talk contribs created page Family:Matrix-Vector Multiplication (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 Admin talk contribs created page Family:Graph Cycles (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 Admin talk contribs created page Family:Price Query (Redirected page to Price Query) Tag: New redirect
• 10:17, 15 February 2023 Admin talk contribs created page Family:Independent Set Queries (Redirected page to Independent Set Queries) Tag: New redirect
• 10:17, 15 February 2023 Admin talk contribs created page Family:Minimum Witness (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 Admin talk contribs created page Family:Local Alignment (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 Admin talk contribs created page Family:Geometric Base (Redirected page to Geometric Base) Tag: New redirect
• 10:17, 15 February 2023 Admin talk contribs created page Family:Motion Planning Problems (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 Admin talk contribs created page Family:Geometric Visibility Problems (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 Admin talk contribs created page Family:Geometric Covering Problems (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 Admin talk contribs created page Family:Geometric Separator Problems (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 Admin talk contribs created page Family:Geometric Incidence Problems (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 Admin talk contribs created page Family:Partial Match (Redirected page to Partial Match) Tag: New redirect
• 10:17, 15 February 2023 Admin talk contribs created page Family:Dynamic Time Warping (Redirected page to Dynamic Time Warping) Tag: New redirect
• 10:17, 15 February 2023 Admin talk contribs created page Family:Frechet Distance (Redirected page to Frechet Distance) Tag: New redirect
• 10:17, 15 February 2023 Admin talk contribs created page Family:Metricity (Redirected page to Metricity) Tag: New redirect
• 10:17, 15 February 2023 Admin talk contribs created page Family:Graph Triangle Problems (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 Admin talk contribs created page Family:Vertex Centrality (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 Admin talk contribs created page Family:Graph Metrics (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 Admin talk contribs created page Family:Orthogonal Vectors (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 Admin talk contribs created page Family:Boolean Satisfiability (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 Admin talk contribs created page Family:Graph Coloring (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 Admin talk contribs created page Family:Recovery (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 Admin talk contribs created page Family:Page Replacements (Created page with "{{DISPLAYTITLE:Page Replacements}}== Description == Currently no description in our database for the given family. == Problems Variations == * Offline * Online")

(newest | oldest) View (newer 50 | older 50) (20 | 50 | 100 | 250 | 500)