Statements (16)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:application |
optimization
dynamic programming transportation problems |
| gptkbp:defines |
A matrix A is a Monge array if for all i < k and j < l, A[i,j] + A[k,l] ≤ A[i,l] + A[k,j]
|
| gptkbp:field |
gptkb:mathematics
computer science |
| gptkbp:namedAfter |
gptkb:Gaspard_Monge
|
| gptkbp:property |
gptkb:Monge_property
|
| gptkbp:relatedTo |
convexity
totally monotone matrix |
| gptkbp:usedIn |
algorithm design
matrix searching algorithms |
| gptkbp:bfsParent |
gptkb:Monge_property
|
| gptkbp:bfsLayer |
8
|
| http://www.w3.org/2000/01/rdf-schema#label |
Monge array
|