Find link

language:

Find link is a tool written by Edward Betts.

Longer titles found: 3-partition problem (view)

searching for Partition problem 20 found (59 total)

Path (graph theory) (1,175 words) [view diff] exact match in snippet view article

between all pairs of vertices in weighted directed graphs. The k-path partition problem is the problem of partitioning a given graph to a smallest collection

Clique cover (939 words) [view diff] no match in snippet view article find links to article

In graph theory, a clique cover or partition into cliques of a given undirected graph is a collection of cliques that cover the whole graph. A minimum

Graph partition (2,979 words) [view diff] exact match in snippet view article find links to article

scheduling in multiprocessor computers, among others. Recently, the graph partition problem has gained importance due to its application for clustering and detection

Polygon partition (2,579 words) [view diff] exact match in snippet view article find links to article

which do not overlap and whose union equals the polygon. A polygon partition problem is a problem of finding a partition which is minimal in some sense

Borsuk's conjecture (1,511 words) [view diff] exact match in snippet view article find links to article

in Combinatorics, course notes. Andrei M. Raigorodskii, The Borsuk partition problem: the seventieth anniversary, Mathematical Intelligencer 26 (2004)

Strength of a graph (508 words) [view diff] exact match in snippet view article find links to article

spanning trees that can be contained in G. Contrary to the graph partition problem, the partitions output by computing the strength are not necessarily

Quotition and partition (667 words) [view diff] exact match in snippet view article find links to article

yielding piles of 13 cards each. If there is a remainder in solving a partition problem, the parts will end up with unequal sizes. For example, if 52 cards

Combinatorial modelling (1,739 words) [view diff] exact match in snippet view article find links to article

C_{15,12}=12!\cdot {\frac {15!}{12!\cdot (15-12)!}}=217945728000} A partition problem requires to divide a set of k elements into n subsets. This model

Bisimulation (2,013 words) [view diff] exact match in snippet view article find links to article

time using partition refinement through a reduction to the coarsest partition problem. Simulation preorder Congruence relation Probabilistic bisimulation

Quantum annealing (3,323 words) [view diff] exact match in snippet view article find links to article

Yan, B. (2023). "Topologically protected Grover's oracle for the partition problem". Physical Review A. 108 (2): 022412. arXiv:2304.10488. Bibcode:2023PhRvA

Barry Pennington (262 words) [view diff] exact match in snippet view article find links to article

1017/S0305004100027122. S2CID 123032372. Pennington, W. B. (1953). "On Mahler's partition problem". Annals of Mathematics. 57 (3): 531–546. doi:10.2307/1969735. JSTOR 1969735

Nanochemistry (4,408 words) [view diff] exact match in snippet view article find links to article

"Hill's small systems nanothermodynamics: a simple macromolecular partition problem with a statistical perspective". Journal of Biological Physics. 38

Grover's algorithm (4,712 words) [view diff] exact match in snippet view article find links to article

; Yan B. (2023). "Topologically protected Grover's oracle for the partition problem". Physical Review A. 108 (2): 022412. arXiv:2304.10488. doi:10.1103/PhysRevA

Graham–Pollak theorem (1,447 words) [view diff] exact match in snippet view article find links to article

the o ( 1 ) {\displaystyle o(1)} term in the exponent. The biclique partition problem takes as input an arbitrary undirected graph, and asks for a partition

Matrix chain multiplication (2,665 words) [view diff] exact match in snippet view article find links to article

an algorithm that finds an optimum solution for the minimum cost partition problem in O(n log n) time. Their proof of correctness of the algorithm relies

Property testing (2,452 words) [view diff] exact match in snippet view article find links to article

Ron. In their seminal paper published in 1998, an abstract graph partition problem is analyzed and some testers provided. These include as special cases

Skew partition (1,935 words) [view diff] exact match in snippet view article find links to article

Sulamita; Gravier, Sylvain; Reed, Bruce A. (2004), "Stable skew partition problem", Discrete Applied Mathematics, 143 (1–3): 17–22, doi:10.1016/j.dam

Guillotine partition (1,283 words) [view diff] exact match in snippet view article find links to article

number of required sheets. In the minimum edge-length rectangular-partition problem, the goal is to partition the original rectilinear polygon into rectangles

Polygon covering (2,229 words) [view diff] exact match in snippet view article find links to article

their union may be smaller than the target polygon, and to a polygon partition problem, in which the units must be disjoint and their union must be equal

Approximate max-flow min-cut theorem (2,264 words) [view diff] exact match in snippet view article find links to article

approximation algorithms for NP-hard problems, such as the graph partition problem and its variations. Here below we briefly introduce a few examples